# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677932 | qwerasdfzxcl | 송금 (JOI19_remittance) | C++17 | 642 ms | 28096 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 <bits/stdc++.h>
typedef long long ll;
using namespace std;
constexpr int INF = 1e9+100;
int n;
void NO(){
printf("No\n");
exit(0);
}
int s[2002000];
void add(ll x, int p){
for (int i=0;i<60;i++) if (x&(1LL<<i)){
s[p+i]++;
}
for (int i=p;;i++){
if (s[i] > 1){
s[i+1] += s[i]/2;
s[i] %= 2;
}
else if (i-p > 60) break;
}
//for (int i=100;i>=0;i--) printf("%d", s[i]);
//printf("\n");
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |