oj.uz

Submission #87764

# Submission time Handle Problem Language Result Execution time Memory
87764 2018-12-02T10:21:08 Z win11905 Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 67316 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
 
const int N = 1e5+5;
const int INF = 1e9;
const int sz = 7;
 
int n, m, q;
vector<int> g[N], topo;
vector<pii> block[N];
int pos[N], deg[N];
int d[N];
map<int, int> tod[N];
bool mark[N];
 
int getInt() {
  int num = 0;
  register int x = -1;
  while(x < '0' || x > '9') x = getchar_unlocked();
  for(; x >= '0' && x <= '9'; x = getchar_unlocked()) num = (num << 1) + (num << 3) + x - '0';
  return num;
}
int main() {
    n = getInt(); m = getInt(); q = getInt();
    for(int i = 0, u, v; i < m; ++i) {
        u = getInt(); v = getInt();
        if(u > v) swap(u, v);
        g[u].emplace_back(v);
        deg[v]++;
    }
    queue<int> Q;
    for(int i = 1; i <= n; ++i) if(!deg[i]) Q.emplace(i);
    while(!Q.empty()) {
        int u = Q.front(); Q.pop();
        topo.emplace_back(u);
        for(auto x : tod[u]) block[u].emplace_back(x);
        block[u].emplace_back(u, 0);
        sort(all(block[u]), [&](const pii &a, const pii &b) { return a.y > b.y; });
        if(block[u].size() > sz) block[u].resize(sz);
        for(int v : g[u]) {
            for(pii x : block[u]) tod[v][x.x] = max(tod[v][x.x], x.y + 1);
            if(!--deg[v]) Q.emplace(v);
        }    
    }
    for(int i = 0, u, t; i < q; ++i) {
        scanf("%d %d", &u, &t);
        vector<int> vec;
        for(int i = 0, v; i < t; ++i) scanf("%d", &v), vec.emplace_back(v);
        if(t < sz) {
            for(int v : vec) mark[v] ^= 1;
            bool st = true;
            for(pii v : block[u]) if(!mark[v.x]) {
                printf("%d\n", v.y), st = false;
                break;
            }
            if(st) puts("-1");
            for(int v : vec) mark[v] ^= 1;
        } else {
            memset(d, 0, sizeof d);
            for(int v : vec) d[v] = -INF;
            for(int i = 0; i < n; ++i) {
                int u = topo[i];
                for(int v : g[u]) d[v] = max(d[v], d[u] + 1);
            }
            printf("%d\n", d[u] < 0 ? -1 : d[u]);
        }
    } 
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &t);
         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:52:54: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int i = 0, v; i < t; ++i) scanf("%d", &v), vec.emplace_back(v);
                                       ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9724 KB Output is correct
2 Correct 10 ms 9808 KB Output is correct
3 Correct 9 ms 9920 KB Output is correct
4 Correct 10 ms 9996 KB Output is correct
5 Correct 12 ms 10712 KB Output is correct
6 Correct 14 ms 10840 KB Output is correct
7 Correct 13 ms 10840 KB Output is correct
8 Correct 12 ms 10840 KB Output is correct
9 Correct 13 ms 10840 KB Output is correct
10 Correct 12 ms 10856 KB Output is correct
11 Correct 14 ms 10856 KB Output is correct
12 Correct 15 ms 10872 KB Output is correct
13 Correct 14 ms 10872 KB Output is correct
14 Correct 13 ms 10872 KB Output is correct
15 Correct 13 ms 10872 KB Output is correct
16 Correct 14 ms 10872 KB Output is correct
17 Correct 12 ms 10872 KB Output is correct
18 Correct 14 ms 10872 KB Output is correct
19 Correct 12 ms 10872 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9724 KB Output is correct
2 Correct 10 ms 9808 KB Output is correct
3 Correct 9 ms 9920 KB Output is correct
4 Correct 10 ms 9996 KB Output is correct
5 Correct 12 ms 10712 KB Output is correct
6 Correct 14 ms 10840 KB Output is correct
7 Correct 13 ms 10840 KB Output is correct
8 Correct 12 ms 10840 KB Output is correct
9 Correct 13 ms 10840 KB Output is correct
10 Correct 12 ms 10856 KB Output is correct
11 Correct 14 ms 10856 KB Output is correct
12 Correct 15 ms 10872 KB Output is correct
13 Correct 14 ms 10872 KB Output is correct
14 Correct 13 ms 10872 KB Output is correct
15 Correct 13 ms 10872 KB Output is correct
16 Correct 14 ms 10872 KB Output is correct
17 Correct 12 ms 10872 KB Output is correct
18 Correct 14 ms 10872 KB Output is correct
19 Correct 12 ms 10872 KB Output is correct
20 Correct 42 ms 11932 KB Output is correct
21 Correct 42 ms 11932 KB Output is correct
22 Correct 43 ms 11932 KB Output is correct
23 Correct 58 ms 11932 KB Output is correct
24 Correct 435 ms 52800 KB Output is correct
25 Correct 494 ms 53312 KB Output is correct
26 Correct 459 ms 54648 KB Output is correct
27 Correct 318 ms 55788 KB Output is correct
28 Correct 322 ms 55788 KB Output is correct
29 Correct 292 ms 55808 KB Output is correct
30 Correct 344 ms 55808 KB Output is correct
31 Correct 409 ms 62648 KB Output is correct
32 Correct 269 ms 62648 KB Output is correct
33 Correct 327 ms 62648 KB Output is correct
34 Correct 503 ms 67316 KB Output is correct
35 Correct 411 ms 67316 KB Output is correct
36 Correct 309 ms 67316 KB Output is correct
37 Correct 414 ms 67316 KB Output is correct
38 Correct 360 ms 67316 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9724 KB Output is correct
2 Correct 10 ms 9808 KB Output is correct
3 Correct 9 ms 9920 KB Output is correct
4 Correct 10 ms 9996 KB Output is correct
5 Correct 12 ms 10712 KB Output is correct
6 Correct 14 ms 10840 KB Output is correct
7 Correct 13 ms 10840 KB Output is correct
8 Correct 12 ms 10840 KB Output is correct
9 Correct 13 ms 10840 KB Output is correct
10 Correct 12 ms 10856 KB Output is correct
11 Correct 14 ms 10856 KB Output is correct
12 Correct 15 ms 10872 KB Output is correct
13 Correct 14 ms 10872 KB Output is correct
14 Correct 13 ms 10872 KB Output is correct
15 Correct 13 ms 10872 KB Output is correct
16 Correct 14 ms 10872 KB Output is correct
17 Correct 12 ms 10872 KB Output is correct
18 Correct 14 ms 10872 KB Output is correct
19 Correct 12 ms 10872 KB Output is correct
20 Correct 42 ms 11932 KB Output is correct
21 Correct 42 ms 11932 KB Output is correct
22 Correct 43 ms 11932 KB Output is correct
23 Correct 58 ms 11932 KB Output is correct
24 Correct 435 ms 52800 KB Output is correct
25 Correct 494 ms 53312 KB Output is correct
26 Correct 459 ms 54648 KB Output is correct
27 Correct 318 ms 55788 KB Output is correct
28 Correct 322 ms 55788 KB Output is correct
29 Correct 292 ms 55808 KB Output is correct
30 Correct 344 ms 55808 KB Output is correct
31 Correct 409 ms 62648 KB Output is correct
32 Correct 269 ms 62648 KB Output is correct
33 Correct 327 ms 62648 KB Output is correct
34 Correct 503 ms 67316 KB Output is correct
35 Correct 411 ms 67316 KB Output is correct
36 Correct 309 ms 67316 KB Output is correct
37 Correct 414 ms 67316 KB Output is correct
38 Correct 360 ms 67316 KB Output is correct
39 Correct 582 ms 67316 KB Output is correct
40 Execution timed out 2102 ms 67316 KB Time limit exceeded
41 Halted 0 ms 0 KB -