# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424661 | Charis02 | Ideal city (IOI12_city) | C++14 | 17 ms | 972 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>
#include<map>
#include<vector>
#include<set>
#include<algorithm>
#define pi pair < int,int >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define MAXN 100004
using namespace std;
int seg[4*MAXN][2];
int id[MAXN];
map < int,int > mapper;
int mod = 1000000000;
void update(int low,int high,int pos,int slow)
{
if(low==slow&&low==high)
{
seg[pos][0]++;
seg[pos][1]+=id[slow];
return;
}
if(low>slow||high<slow)
return;
int mid = (low+high) / 2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |