Submission #1431663


Source Code Expand

#include <iostream>
#include <vector>
#include <map> 
#include <algorithm>
#include <string.h>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

typedef long long int ll;



void pre_process(string p, int *back_table){
    int i = 0, j = -1, length = p.length();
    back_table[0] = -1;

    while(i <= length) { 
        while(j != -1 && p[i] != p[j]) j = back_table[j];
        i++; j++;
        back_table[i] = j;
    }

}

void _search(string p, string t, int *back_table){
    int i = 0, j = 0, length = t.length(), m = p.length();

    while(i <= length){
        while(j != 0 && t[i] != p[j]) j = back_table[j];
        i++; j++;
        if(j == m) { cout << "Pattern at: " << i - j << endl; j = back_table[j]; }
    }
}

int func(int arr[],int n,int m) {
    int maxsum;
    int incl[n];
    int excl[n];
    incl[0] = arr[0];
    excl [0] = 0;
    for(int i=1;i<n;i++) {
        if(i-m-1 >=0) {
            incl[i] = max(incl[i-m-1],excl[i-m-1]) + arr[i];
        }
        else
            incl[i] = arr[i];
        
        excl[i] = max(excl[i-1],incl[i-1]);
        maxsum = max(maxsum,max(incl[i],excl[i]));
    }

    return maxsum;
}

int show(int x, float y){
    return x + y;
}


int show(int x){ return x; }

float fn_(int x = show(2, 3.3)){
    return x;
}

int fn(int x = show(2)){
    return x;
}

int solve(){
    int n, c, k;
    cin >> n >> c >> k;
    int a[n];

    for(int i = 0; i < n; i++){
        cin >> a[i];
    }

    sort(a, a + n);
    int people = 0, start = 0, bus = 0, i = 0;

    while(i < n){
        if(people < c && a[i] - a[start] <= k){
            // cout << i << ' ';
            i++;
            people++;
        }
        else if(people >= c){
            // cout << i << endl;
            start = i;
            bus++;
            people = 0;
        }
        else if(a[i] - a[start] > k){
            // cout << i << endl;  
            start = i;
            bus++;
        }
    }
    if(people > 0)
        ++bus;
    cout << bus ;
}


int main() {
    solve();
}



// akasakaakas 
// akasakaakas


// akasakaakasaka

// kesav696@sbi
// kesav1096@sbi






Submission Info

Submission Time
Task A - Airport Bus
User sragha45
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2319 Byte
Status WA
Exec Time 61 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 8
WA × 4
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 1 ms 256 KB
in2.txt AC 59 ms 640 KB
in3.txt WA 60 ms 640 KB
in4.txt AC 59 ms 640 KB
in5.txt WA 2 ms 256 KB
in6.txt AC 61 ms 640 KB
in7.txt WA 52 ms 640 KB
in8.txt WA 60 ms 640 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB