| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 108111 | wilwxk | Regions (IOI09_regions) | C++11 | 46 ms | 6912 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 MAXN=200005;
const int MAXC=25005;
const int T=550;
vector<int> g[MAXN];
vector<int> lista[MAXC];
map<int, int> mp;
int cor[MAXN], tam[MAXN];
char isbig[MAXC];
int dp[MAXN][(MAXN/T)+2], dp2[MAXN][(MAXN/T)+2];
int n,cores, q, cntbig;
void dfs(int cur) {
dp[cur][mp[cor[cur]]]++;
for(auto viz : g[cur]) {
dfs(viz);
for(int i=1; i<=cntbig; i++) dp[cur][i]+=dp[viz][i];
}
}
int main() {
scanf("%d %d %d", &n, &cores, &q);
for(int i=1; i<=n; i++) {
int a=0, b=0; scanf("%d %d", &a, &b);
g[a].push_back(i); cor[i]=b;
lista[b].push_back(i);
if(lista[b].size()==T) isbig[b]=1, mp[b]=1;
}
for(auto &mit : mp) mit.second=++cntbig;
while(q--) {
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
