# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415752 | Antekb | Regions (IOI09_regions) | C++14 | 4951 ms | 130604 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;
const int N=500, M=25000, K=200000;
vector<int> E[K];
int R[K], pre[K], post[K], ile3[M], sta[M], sta2[M];
vector<int> pocz[M], kon[M];
int ile[M][N], ile2[M][N], gdzie[M];
vector<int> duz;
int wsk=0;
void dfs(int v){
//cout<<v<<"q\n";
pre[v]=wsk++;
pocz[R[v]].push_back(pre[v]);
sta[R[v]]++;
sta2[R[v]]++;
for(int i=0; i<duz.size(); i++){
ile[R[v]][i]-=sta[duz[i]];
ile2[R[v]][i]+=sta2[duz[i]];
}
for(int u:E[v]){
dfs(u);
}
for(int i=0; i<duz.size(); i++){
ile[R[v]][i]+=sta[duz[i]];
}
sta2[R[v]]--;
post[v]=wsk;
kon[R[v]].push_back(post[v]);
}
int main(){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |