Submission #667141

# Submission time Handle Problem Language Result Execution time Memory
667141 2022-11-30T12:36:21 Z divad Subway (info1cup19_subway) C++14
0 / 100
1 ms 212 KB
#include <iostream>
#include <algorithm>
#define int long long
#define MAX 1000002
using namespace std;
int t,n,k,a[MAX],nrp;

int once(){
    int newk = 1000000002;
    for(int i = 1; i <= n; i++){
        if(a[i] > 0){
            nrp += (a[i]/k)+(a[i]%k > 0);
            a[i] = a[i]%k;
            if(a[i] > 0){
                newk = min(newk, a[i]);
            }
        }
    }
    if(newk == 1000000002){
        newk = 0;
    }
    k = newk;
}

void solve(){
    cin >> n >> k;
    nrp = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    sort(a+1, a+n+1);
    while(k > 0){
        once();
    }
    cout << (nrp%2);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

subway.cpp: In function 'long long int once()':
subway.cpp:23:1: warning: no return statement in function returning non-void [-Wreturn-type]
   23 | }
      | ^
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -