# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67615 | imsifile | Nectar with Coconut Jelly (FXCUP3_nectar) | C++98 | 566 ms | 1492 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<stdio.h>
#include<vector>
using namespace std;
typedef long long lld;
struct rle {
int a, rpt;
rle(int a_=0, int rpt_=0) : a(a_), rpt(rpt_) {}
};
int N, J, R, T;
vector<rle> v[2];
lld sum;
int ce(int a){ return (a+R-1)/R; }
void push(int ix, rle k){
if(k.rpt == 0) return;
if(v[ix].empty()){ v[ix].push_back(k); return; }
int last=v[ix].size()-1;
if(v[ix][last].a == k.a) v[ix][last].rpt += k.rpt;
else v[ix].push_back(k);
}
int main(){
scanf("%d%d%d%d", &N, &J, &R, &T);
if(N==1){ printf("%d\n", J); return 0; }
push(0, rle(J, N-1)), sum=J;
int cur=0;
for(int i=T; i--;){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |