# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94604 | ahmedie404 | Timovi (COCI18_timovi) | C++14 | 1075 ms | 1532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
int ts[200000+9];
int n;
long long k, m;
int main(){
cin >> n >> k >> m;
for(int i=0;i<n;i++) ts[i]=0;
int idx=0;
bool forw=true;
while(true){
if(idx >= n){
idx = n-2;
forw = false;
continue;
}
if(idx < 0){
idx = 1;
forw = true;
continue;
}
if(k > 0 && m > 0){
ts[idx] += ( m >= k ) ? k : m;
m-=( m >= k ) ? k : m;
idx += forw == true ? 1 : -1;
} else break;
}
for(int i=0;i<n;i++){
cout << ts[i] << " ";
}
cout << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |