oj.uz

Submission #897503

# Submission time Handle Problem Language Result Execution time Memory
897503 2024-01-03T09:58:11 Z a_l_i_r_e_z_a Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 475 ms 268720 KB 
// In the name of Allah
// Hope is last to die
// Khodaya khodet komak kon
// Let's go

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())

const int maxn = 1e5 + 10, msq = 320 + 10;
const int inf = 1e9 + 7;
int n, m, q, sq, cur[maxn], val[maxn];
pii dp[maxn][msq];
vector<int> adj[maxn], party;
bool mark[maxn];

void calcdp(){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < sq; j++) dp[i][j] = mp(-1, 0);
    }
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < sq; j++){
            pii res = mp(-1, 0);
            for(int k = 0; k < sz(adj[i]); k++){
                int u = adj[i][k];
                while(mark[dp[u][cur[u]].S]) cur[u]++;
                if(!dp[u][cur[u]].S) continue;
                if(dp[u][cur[u]].F + 1 > res.F) res = mp(dp[u][cur[u]].F + 1, dp[u][cur[u]].S);
            }
            dp[i][j] = res;
            if(res.S) mark[res.S] = 1;
        }
        for(int j = 0; j < sq; j++){
            mark[dp[i][j].S] = 0;
            if(dp[i][j].F == -1){
                dp[i][j] = mp(0, i);
                break;
            }
        }
        for(auto u: adj[i]) cur[u] = 0;
    }
}

int get(int v){
    for(int i = 1; i <= v; i++){
        val[i] = (mark[i] ? -1 : 0);
        for(auto u: adj[i]){
            if(~val[u]) smax(val[i], val[u] + 1);
        }
    }
    return val[v];
}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m >> q;
    sq = 320;
    for(int i = 0; i < m; i++){
        int u, v; cin >> u >> v;
        adj[v].pb(u);
    }
    calcdp();
    while(q--){
        int v, y; cin >> v >> y;
        party.clear();
        for(int i = 0; i < y; i++){
            int x; cin >> x;
            mark[x] = 1;
            party.pb(x);
        }
        if(y >= sq) cout << get(v) << '\n';
        else{
            for(int i = 0; i < sq; i++){
                if(!mark[dp[v][i].S]){
                    cout << dp[v][i].F << '\n';
                    break;
                }
            }
        }
        for(auto u: party) mark[u] = 0;
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4660 KB Output is correct
4 Correct 1 ms 4668 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 4 ms 6744 KB Output is correct
10 Correct 6 ms 6708 KB Output is correct
11 Correct 4 ms 6720 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 4 ms 6744 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 6744 KB Output is correct
16 Correct 4 ms 6748 KB Output is correct
17 Correct 4 ms 6768 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4660 KB Output is correct
4 Correct 1 ms 4668 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 4 ms 6744 KB Output is correct
10 Correct 6 ms 6708 KB Output is correct
11 Correct 4 ms 6720 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 4 ms 6744 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 6744 KB Output is correct
16 Correct 4 ms 6748 KB Output is correct
17 Correct 4 ms 6768 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 205 ms 9040 KB Output is correct
21 Correct 199 ms 9112 KB Output is correct
22 Correct 206 ms 9224 KB Output is correct
23 Correct 232 ms 9232 KB Output is correct
24 Correct 411 ms 266156 KB Output is correct
25 Correct 434 ms 264948 KB Output is correct
26 Correct 395 ms 264828 KB Output is correct
27 Correct 362 ms 265180 KB Output is correct
28 Correct 345 ms 265168 KB Output is correct
29 Correct 349 ms 265448 KB Output is correct
30 Correct 368 ms 265168 KB Output is correct
31 Correct 368 ms 265352 KB Output is correct
32 Correct 346 ms 265176 KB Output is correct
33 Correct 319 ms 264756 KB Output is correct
34 Correct 291 ms 264868 KB Output is correct
35 Correct 313 ms 264924 KB Output is correct
36 Correct 331 ms 264912 KB Output is correct
37 Correct 360 ms 264688 KB Output is correct
38 Correct 350 ms 264772 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4660 KB Output is correct
4 Correct 1 ms 4668 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 4 ms 6744 KB Output is correct
10 Correct 6 ms 6708 KB Output is correct
11 Correct 4 ms 6720 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 4 ms 6744 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 6744 KB Output is correct
16 Correct 4 ms 6748 KB Output is correct
17 Correct 4 ms 6768 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 205 ms 9040 KB Output is correct
21 Correct 199 ms 9112 KB Output is correct
22 Correct 206 ms 9224 KB Output is correct
23 Correct 232 ms 9232 KB Output is correct
24 Correct 411 ms 266156 KB Output is correct
25 Correct 434 ms 264948 KB Output is correct
26 Correct 395 ms 264828 KB Output is correct
27 Correct 362 ms 265180 KB Output is correct
28 Correct 345 ms 265168 KB Output is correct
29 Correct 349 ms 265448 KB Output is correct
30 Correct 368 ms 265168 KB Output is correct
31 Correct 368 ms 265352 KB Output is correct
32 Correct 346 ms 265176 KB Output is correct
33 Correct 319 ms 264756 KB Output is correct
34 Correct 291 ms 264868 KB Output is correct
35 Correct 313 ms 264924 KB Output is correct
36 Correct 331 ms 264912 KB Output is correct
37 Correct 360 ms 264688 KB Output is correct
38 Correct 350 ms 264772 KB Output is correct
39 Correct 420 ms 264532 KB Output is correct
40 Correct 421 ms 264264 KB Output is correct
41 Correct 412 ms 264532 KB Output is correct
42 Correct 446 ms 264976 KB Output is correct
43 Correct 395 ms 264764 KB Output is correct
44 Correct 235 ms 8220 KB Output is correct
45 Correct 211 ms 8020 KB Output is correct
46 Correct 210 ms 7888 KB Output is correct
47 Correct 230 ms 7772 KB Output is correct
48 Correct 217 ms 7936 KB Output is correct
49 Correct 384 ms 265256 KB Output is correct
50 Correct 372 ms 265016 KB Output is correct
51 Correct 234 ms 8176 KB Output is correct
52 Correct 204 ms 7760 KB Output is correct
53 Correct 366 ms 265332 KB Output is correct
54 Correct 398 ms 267552 KB Output is correct
55 Correct 349 ms 266836 KB Output is correct
56 Correct 369 ms 266584 KB Output is correct
57 Correct 226 ms 10832 KB Output is correct
58 Correct 222 ms 10580 KB Output is correct
59 Correct 208 ms 9552 KB Output is correct
60 Correct 223 ms 9600 KB Output is correct
61 Correct 392 ms 267552 KB Output is correct
62 Correct 393 ms 267156 KB Output is correct
63 Correct 458 ms 267188 KB Output is correct
64 Correct 446 ms 267504 KB Output is correct
65 Correct 457 ms 267340 KB Output is correct
66 Correct 475 ms 267164 KB Output is correct
67 Correct 362 ms 266956 KB Output is correct
68 Correct 336 ms 266572 KB Output is correct
69 Correct 363 ms 266840 KB Output is correct
70 Correct 374 ms 267656 KB Output is correct
71 Correct 351 ms 267332 KB Output is correct
72 Correct 372 ms 267316 KB Output is correct
73 Correct 392 ms 267752 KB Output is correct
74 Correct 351 ms 267292 KB Output is correct
75 Correct 390 ms 267296 KB Output is correct
76 Correct 377 ms 268720 KB Output is correct
77 Correct 362 ms 267364 KB Output is correct
78 Correct 353 ms 267856 KB Output is correct
79 Correct 266 ms 10348 KB Output is correct
80 Correct 218 ms 9808 KB Output is correct
81 Correct 220 ms 9460 KB Output is correct
82 Correct 379 ms 268676 KB Output is correct
83 Correct 419 ms 268636 KB Output is correct
84 Correct 353 ms 267348 KB Output is correct
85 Correct 395 ms 267592 KB Output is correct
86 Correct 378 ms 267860 KB Output is correct
87 Correct 396 ms 268372 KB Output is correct
88 Correct 221 ms 10528 KB Output is correct
89 Correct 223 ms 10324 KB Output is correct
90 Correct 267 ms 9872 KB Output is correct
91 Correct 208 ms 9848 KB Output is correct
92 Correct 216 ms 9296 KB Output is correct
93 Correct 228 ms 9312 KB Output is correct
94 Correct 355 ms 268116 KB Output is correct
95 Correct 329 ms 268080 KB Output is correct
96 Correct 309 ms 267016 KB Output is correct
97 Correct 316 ms 266748 KB Output is correct
98 Correct 313 ms 267440 KB Output is correct
99 Correct 306 ms 267840 KB Output is correct
100 Correct 250 ms 10484 KB Output is correct
101 Correct 249 ms 10496 KB Output is correct
102 Correct 262 ms 9744 KB Output is correct
103 Correct 232 ms 9724 KB Output is correct
104 Correct 238 ms 9296 KB Output is correct
105 Correct 240 ms 9296 KB Output is correct
106 Correct 401 ms 268212 KB Output is correct
107 Correct 392 ms 268328 KB Output is correct
108 Correct 341 ms 266836 KB Output is correct
109 Correct 387 ms 266972 KB Output is correct
110 Correct 351 ms 267600 KB Output is correct
111 Correct 419 ms 267448 KB Output is correct
112 Correct 223 ms 10548 KB Output is correct
113 Correct 231 ms 10368 KB Output is correct
114 Correct 223 ms 9812 KB Output is correct
115 Correct 208 ms 9796 KB Output is correct
116 Correct 219 ms 9468 KB Output is correct
117 Correct 218 ms 9484 KB Output is correct
118 Correct 347 ms 266936 KB Output is correct
119 Correct 340 ms 266536 KB Output is correct
120 Correct 368 ms 266620 KB Output is correct
121 Correct 350 ms 267088 KB Output is correct
122 Correct 339 ms 266572 KB Output is correct
123 Correct 360 ms 266560 KB Output is correct
124 Correct 377 ms 266960 KB Output is correct
125 Correct 338 ms 266728 KB Output is correct
126 Correct 368 ms 266560 KB Output is correct