oj.uz

답안 #87758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
87758 2018-12-02T10:17:10 Z win11905 Bitaro’s Party (JOI18_bitaro) C++11
14 / 100
 2000 ms 86424 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 = 10;
 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 12 ms 9720 KB Output is correct
3 Correct 11 ms 9864 KB Output is correct
4 Correct 10 ms 9864 KB Output is correct
5 Correct 13 ms 10708 KB Output is correct
6 Correct 13 ms 10836 KB Output is correct
7 Correct 13 ms 10836 KB Output is correct
8 Correct 13 ms 10964 KB Output is correct
9 Correct 15 ms 10964 KB Output is correct
10 Correct 13 ms 10964 KB Output is correct
11 Correct 15 ms 11040 KB Output is correct
12 Correct 16 ms 11056 KB Output is correct
13 Correct 15 ms 11056 KB Output is correct
14 Correct 15 ms 11056 KB Output is correct
15 Correct 15 ms 11056 KB Output is correct
16 Correct 17 ms 11056 KB Output is correct
17 Correct 15 ms 11056 KB Output is correct
18 Correct 15 ms 11056 KB Output is correct
19 Correct 16 ms 11056 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 12 ms 9720 KB Output is correct
3 Correct 11 ms 9864 KB Output is correct
4 Correct 10 ms 9864 KB Output is correct
5 Correct 13 ms 10708 KB Output is correct
6 Correct 13 ms 10836 KB Output is correct
7 Correct 13 ms 10836 KB Output is correct
8 Correct 13 ms 10964 KB Output is correct
9 Correct 15 ms 10964 KB Output is correct
10 Correct 13 ms 10964 KB Output is correct
11 Correct 15 ms 11040 KB Output is correct
12 Correct 16 ms 11056 KB Output is correct
13 Correct 15 ms 11056 KB Output is correct
14 Correct 15 ms 11056 KB Output is correct
15 Correct 15 ms 11056 KB Output is correct
16 Correct 17 ms 11056 KB Output is correct
17 Correct 15 ms 11056 KB Output is correct
18 Correct 15 ms 11056 KB Output is correct
19 Correct 16 ms 11056 KB Output is correct
20 Correct 66 ms 11988 KB Output is correct
21 Correct 63 ms 12124 KB Output is correct
22 Correct 66 ms 12124 KB Output is correct
23 Correct 70 ms 12124 KB Output is correct
24 Correct 546 ms 67528 KB Output is correct
25 Correct 540 ms 71212 KB Output is correct
26 Correct 452 ms 71212 KB Output is correct
27 Correct 344 ms 76040 KB Output is correct
28 Correct 361 ms 76184 KB Output is correct
29 Correct 369 ms 76184 KB Output is correct
30 Correct 385 ms 76184 KB Output is correct
31 Correct 502 ms 86424 KB Output is correct
32 Correct 370 ms 86424 KB Output is correct
33 Correct 398 ms 86424 KB Output is correct
34 Correct 625 ms 86424 KB Output is correct
35 Correct 445 ms 86424 KB Output is correct
36 Correct 398 ms 86424 KB Output is correct
37 Correct 498 ms 86424 KB Output is correct
38 Correct 379 ms 86424 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 12 ms 9720 KB Output is correct
3 Correct 11 ms 9864 KB Output is correct
4 Correct 10 ms 9864 KB Output is correct
5 Correct 13 ms 10708 KB Output is correct
6 Correct 13 ms 10836 KB Output is correct
7 Correct 13 ms 10836 KB Output is correct
8 Correct 13 ms 10964 KB Output is correct
9 Correct 15 ms 10964 KB Output is correct
10 Correct 13 ms 10964 KB Output is correct
11 Correct 15 ms 11040 KB Output is correct
12 Correct 16 ms 11056 KB Output is correct
13 Correct 15 ms 11056 KB Output is correct
14 Correct 15 ms 11056 KB Output is correct
15 Correct 15 ms 11056 KB Output is correct
16 Correct 17 ms 11056 KB Output is correct
17 Correct 15 ms 11056 KB Output is correct
18 Correct 15 ms 11056 KB Output is correct
19 Correct 16 ms 11056 KB Output is correct
20 Correct 66 ms 11988 KB Output is correct
21 Correct 63 ms 12124 KB Output is correct
22 Correct 66 ms 12124 KB Output is correct
23 Correct 70 ms 12124 KB Output is correct
24 Correct 546 ms 67528 KB Output is correct
25 Correct 540 ms 71212 KB Output is correct
26 Correct 452 ms 71212 KB Output is correct
27 Correct 344 ms 76040 KB Output is correct
28 Correct 361 ms 76184 KB Output is correct
29 Correct 369 ms 76184 KB Output is correct
30 Correct 385 ms 76184 KB Output is correct
31 Correct 502 ms 86424 KB Output is correct
32 Correct 370 ms 86424 KB Output is correct
33 Correct 398 ms 86424 KB Output is correct
34 Correct 625 ms 86424 KB Output is correct
35 Correct 445 ms 86424 KB Output is correct
36 Correct 398 ms 86424 KB Output is correct
37 Correct 498 ms 86424 KB Output is correct
38 Correct 379 ms 86424 KB Output is correct
39 Correct 537 ms 86424 KB Output is correct
40 Execution timed out 2024 ms 86424 KB Time limit exceeded
41 Halted 0 ms 0 KB -