# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
895379 | Ahmed57 | Regions (IOI09_regions) | C++17 | 3261 ms | 131072 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>
using namespace std;
long long frq[25001],a3[25001];
int xd[25001],x,p,lol[200001],j,a,b,B = 500;
vector<int> adj[200001];
vector<int> bi;
int rev[25001];
long long cs1[25001][501],cs2[25001][501];
int timer = 0;
vector<pair<int,int>> rngs[25001];
long long idx,all;
void dfs(int i){
frq[lol[i]]++;
a3[lol[i]]++;
timer++;
int sav = timer;
for(j = 0;j<bi.size();j++){
//cout<<i<<" "<<qu[i][j].first<<" "<<qu[i][j].second<<endl;
cs1[lol[i]][j]+=frq[bi[j]];
cs2[lol[i]][j]-=a3[bi[j]];
}
for(int w = 0;w<adj[i].size();w++){
dfs(adj[i][w]);
}
for(j = 0;j<bi.size();j++){
cs2[lol[i]][j]+=a3[bi[j]];
}
rngs[lol[i]].push_back({timer,sav});
frq[lol[i]]--;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |