# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140401 | shashwatchandra | The Big Prize (IOI17_prize) | C++17 | 113 ms | 1276 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 "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0;i < n;i++)
#define RE(i,n) for(int i = 1;i <= n;i++)
const int N = 2e5+1;
int blocksize = N;
int block[N];
int blockstart[N];
int find_best(int n) {
int curblock = 1;
int cursize = 0;
blockstart[1] = 0;
for(int i = 0;i < n;i++){
block[i] = curblock;
cursize++;
if(cursize == blocksize){
curblock++;
cursize = 0;
blockstart[curblock] = i+1;
}
}
int i = 0;
while(i < n){
int lo = i;
int hi = min(n-1,blockstart[block[i]]+blocksize-1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |