| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 67430 | 2018-08-14T09:18:35 Z | Crown | Regions (IOI09_regions) | C++14 | 1715 ms | 91460 KB |
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
#define lim 316
const int maxn = 2e5+5;
const int maxr = 3e4+5;
vector<int> adj[maxn];
int re[maxn];
int num[maxn];
int cnt[maxn];
int cur = 0;
int n, r, q;
vector<int> regions[maxn];
vector<int> blocks[maxn];
vector< ii > res[maxn];
void dfs(int u, int p)
{
cur++;
num[u] = cur;
cnt[u] = 1;
for(auto v : adj[u])
{
if(v == p) continue;
dfs(v, u);
cnt[u] += cnt[v];
}
}
bool cmp(int a, int b)
{
if(abs(a) != abs(b)) return abs(a)< abs(b);
return a< b;
}
map<ii, ll> cache;
int main()
{
scanf("%d %d %d", &n, &r, &q);
scanf("%d", re+1);
for(int i = 2; i<= n; i++)
{
int x;
scanf("%d %d", &x, &re[i]);
adj[x].pb(i);
}
dfs(1, 0);
for(int i = 1; i<= n; i++)
{
regions[re[i]].pb(num[i]);
blocks[re[i]].pb(num[i]);
blocks[re[i]].pb(-num[i]-cnt[i]);
}
for(int i = 1; i<= r; i++)
{
sort(regions[i].begin(), regions[i].end());
sort(blocks[i].begin(), blocks[i].end(), cmp);
vector< ii > tmp;
for(int j = 0; j< (int) blocks[i].size(); j++)
{
if(tmp.empty() || abs(blocks[i][j]) != tmp.back().X)
{
tmp.pb(ii(abs(blocks[i][j]), blocks[i][j]>0?1:-1));
}
else
{
tmp.back().Y += (blocks[i][j]>0?1:-1);
}
}
if(!tmp.empty()) res[i].pb(tmp[0]);
for(int j = 1; j< (int) tmp.size(); j++)
{
res[i].pb(ii(tmp[j].X, res[i].back().Y+tmp[j].Y));
}
}
while(q--)
{
int r1, r2; scanf("%d %d", &r1, &r2);
if(cache.find(ii(r1, r2)) != cache.end())
{
printf("%lld\n", cache[ii(r1, r2)]);
fflush(stdout);
continue;
}
if(regions[r1].empty() || regions[r2].empty())
{
printf("0\n");
fflush(stdout);
cache[ii(r1, r2)] = 0;
continue;
}
ll ret = 0;
if(r1>= lim || r2>= lim)
{
assert(0);
if(r1> r2)
{
for(auto x : regions[r2])
{
int ind = upper_bound(res[r1].begin(), res[r1].end(), ii(x, 1e9))-res[r1].begin()-1;
if(ind< 0) continue;
ret += res[r1][ind].Y;
}
}
else
{
for(int i = 1; i< (int) res[r1].size(); i++)
{
int lb = res[r1][i-1].X;
int rb = res[r1][i].X-1;
int cnt = res[r1][i-1].Y;
int cnt2 = lower_bound(regions[r2].begin(), regions[r2].end(), rb)-lower_bound(regions[r2].begin(), regions[r2].end(), lb-1);
ret += 1LL*cnt*cnt2;
}
}
}
else
{
int pt = 0;
for(auto x : regions[r2])
{
while(pt< (int) res[r1].size() && res[r1][pt].X<= x) pt++;
if(pt) ret += res[r1][pt-1].Y;
}
}
cache[ii(r1, r2)] = ret;
printf("%lld\n", ret);
fflush(stdout);
}
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 21 ms | 19064 KB | Output is correct |
| 2 | Correct | 22 ms | 19128 KB | Output is correct |
| 3 | Correct | 24 ms | 19332 KB | Output is correct |
| 4 | Correct | 28 ms | 19332 KB | Output is correct |
| 5 | Correct | 28 ms | 19332 KB | Output is correct |
| 6 | Correct | 47 ms | 19420 KB | Output is correct |
| 7 | Correct | 47 ms | 19516 KB | Output is correct |
| 8 | Correct | 53 ms | 19672 KB | Output is correct |
| 9 | Correct | 73 ms | 20300 KB | Output is correct |
| 10 | Runtime error | 49 ms | 39884 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 11 | Incorrect | 101 ms | 40792 KB | Expected integer, but "prog1:" found |
| 12 | Runtime error | 65 ms | 42256 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 13 | Runtime error | 57 ms | 42256 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 14 | Incorrect | 218 ms | 43588 KB | Expected integer, but "prog1:" found |
| 15 | Incorrect | 265 ms | 46752 KB | Expected integer, but "prog1:" found |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1123 ms | 48352 KB | Expected integer, but "prog1:" found |
| 2 | Incorrect | 905 ms | 48352 KB | Expected integer, but "prog1:" found |
| 3 | Incorrect | 1715 ms | 52964 KB | Expected integer, but "prog1:" found |
| 4 | Runtime error | 81 ms | 52964 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 5 | Runtime error | 75 ms | 52964 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 6 | Runtime error | 78 ms | 52964 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 7 | Runtime error | 112 ms | 52964 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 8 | Runtime error | 133 ms | 63088 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 9 | Runtime error | 174 ms | 67428 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 10 | Runtime error | 194 ms | 78580 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 11 | Runtime error | 216 ms | 78580 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 12 | Runtime error | 244 ms | 78580 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 13 | Runtime error | 194 ms | 78580 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 14 | Runtime error | 230 ms | 78580 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 15 | Runtime error | 201 ms | 79908 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 16 | Runtime error | 243 ms | 91460 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
| 17 | Runtime error | 201 ms | 91460 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |