oj.uz

Submission #897504

# Submission time Handle Problem Language Result Execution time Memory
897504 2024-01-03T09:59:49 Z a_l_i_r_e_z_a Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 427 ms 265668 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 = 200;
    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 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4528 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 3 ms 6748 KB Output is correct
11 Correct 4 ms 6748 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 3 ms 6748 KB Output is correct
14 Correct 3 ms 6748 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 3 ms 6740 KB Output is correct
17 Correct 3 ms 6748 KB Output is correct
18 Correct 3 ms 6748 KB Output is correct
19 Correct 3 ms 6748 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4528 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 3 ms 6748 KB Output is correct
11 Correct 4 ms 6748 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 3 ms 6748 KB Output is correct
14 Correct 3 ms 6748 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 3 ms 6740 KB Output is correct
17 Correct 3 ms 6748 KB Output is correct
18 Correct 3 ms 6748 KB Output is correct
19 Correct 3 ms 6748 KB Output is correct
20 Correct 151 ms 7952 KB Output is correct
21 Correct 149 ms 7760 KB Output is correct
22 Correct 187 ms 7972 KB Output is correct
23 Correct 160 ms 7772 KB Output is correct
24 Correct 301 ms 264992 KB Output is correct
25 Correct 314 ms 264912 KB Output is correct
26 Correct 321 ms 265176 KB Output is correct
27 Correct 263 ms 265280 KB Output is correct
28 Correct 283 ms 265164 KB Output is correct
29 Correct 254 ms 265420 KB Output is correct
30 Correct 261 ms 265396 KB Output is correct
31 Correct 274 ms 265196 KB Output is correct
32 Correct 263 ms 265168 KB Output is correct
33 Correct 231 ms 264652 KB Output is correct
34 Correct 256 ms 264912 KB Output is correct
35 Correct 234 ms 264660 KB Output is correct
36 Correct 290 ms 265100 KB Output is correct
37 Correct 274 ms 264844 KB Output is correct
38 Correct 252 ms 264784 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4528 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 3 ms 6748 KB Output is correct
11 Correct 4 ms 6748 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 3 ms 6748 KB Output is correct
14 Correct 3 ms 6748 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 3 ms 6740 KB Output is correct
17 Correct 3 ms 6748 KB Output is correct
18 Correct 3 ms 6748 KB Output is correct
19 Correct 3 ms 6748 KB Output is correct
20 Correct 151 ms 7952 KB Output is correct
21 Correct 149 ms 7760 KB Output is correct
22 Correct 187 ms 7972 KB Output is correct
23 Correct 160 ms 7772 KB Output is correct
24 Correct 301 ms 264992 KB Output is correct
25 Correct 314 ms 264912 KB Output is correct
26 Correct 321 ms 265176 KB Output is correct
27 Correct 263 ms 265280 KB Output is correct
28 Correct 283 ms 265164 KB Output is correct
29 Correct 254 ms 265420 KB Output is correct
30 Correct 261 ms 265396 KB Output is correct
31 Correct 274 ms 265196 KB Output is correct
32 Correct 263 ms 265168 KB Output is correct
33 Correct 231 ms 264652 KB Output is correct
34 Correct 256 ms 264912 KB Output is correct
35 Correct 234 ms 264660 KB Output is correct
36 Correct 290 ms 265100 KB Output is correct
37 Correct 274 ms 264844 KB Output is correct
38 Correct 252 ms 264784 KB Output is correct
39 Correct 336 ms 264508 KB Output is correct
40 Correct 313 ms 264572 KB Output is correct
41 Correct 294 ms 264300 KB Output is correct
42 Correct 357 ms 265048 KB Output is correct
43 Correct 308 ms 264656 KB Output is correct
44 Correct 175 ms 8228 KB Output is correct
45 Correct 159 ms 8016 KB Output is correct
46 Correct 190 ms 7768 KB Output is correct
47 Correct 166 ms 7948 KB Output is correct
48 Correct 149 ms 7936 KB Output is correct
49 Correct 276 ms 265312 KB Output is correct
50 Correct 256 ms 264904 KB Output is correct
51 Correct 172 ms 8180 KB Output is correct
52 Correct 146 ms 7944 KB Output is correct
53 Correct 298 ms 264628 KB Output is correct
54 Correct 319 ms 264576 KB Output is correct
55 Correct 292 ms 264272 KB Output is correct
56 Correct 286 ms 264304 KB Output is correct
57 Correct 171 ms 8236 KB Output is correct
58 Correct 174 ms 8216 KB Output is correct
59 Correct 177 ms 7964 KB Output is correct
60 Correct 149 ms 7772 KB Output is correct
61 Correct 303 ms 265040 KB Output is correct
62 Correct 305 ms 264672 KB Output is correct
63 Correct 328 ms 264632 KB Output is correct
64 Correct 394 ms 265140 KB Output is correct
65 Correct 397 ms 264788 KB Output is correct
66 Correct 427 ms 265088 KB Output is correct
67 Correct 383 ms 265240 KB Output is correct
68 Correct 373 ms 264740 KB Output is correct
69 Correct 391 ms 264788 KB Output is correct
70 Correct 269 ms 265200 KB Output is correct
71 Correct 260 ms 264832 KB Output is correct
72 Correct 294 ms 265556 KB Output is correct
73 Correct 274 ms 265040 KB Output is correct
74 Correct 268 ms 264828 KB Output is correct
75 Correct 305 ms 264760 KB Output is correct
76 Correct 289 ms 265340 KB Output is correct
77 Correct 277 ms 265160 KB Output is correct
78 Correct 267 ms 265220 KB Output is correct
79 Correct 160 ms 8272 KB Output is correct
80 Correct 148 ms 8016 KB Output is correct
81 Correct 152 ms 7932 KB Output is correct
82 Correct 284 ms 265300 KB Output is correct
83 Correct 321 ms 265056 KB Output is correct
84 Correct 316 ms 265104 KB Output is correct
85 Correct 317 ms 265668 KB Output is correct
86 Correct 270 ms 265296 KB Output is correct
87 Correct 282 ms 265128 KB Output is correct
88 Correct 178 ms 8244 KB Output is correct
89 Correct 162 ms 8200 KB Output is correct
90 Correct 147 ms 8020 KB Output is correct
91 Correct 161 ms 8016 KB Output is correct
92 Correct 150 ms 7768 KB Output is correct
93 Correct 150 ms 7968 KB Output is correct
94 Correct 269 ms 265040 KB Output is correct
95 Correct 261 ms 264576 KB Output is correct
96 Correct 274 ms 264568 KB Output is correct
97 Correct 258 ms 264496 KB Output is correct
98 Correct 267 ms 264728 KB Output is correct
99 Correct 238 ms 264760 KB Output is correct
100 Correct 172 ms 8204 KB Output is correct
101 Correct 172 ms 8272 KB Output is correct
102 Correct 156 ms 7760 KB Output is correct
103 Correct 180 ms 7948 KB Output is correct
104 Correct 150 ms 7956 KB Output is correct
105 Correct 166 ms 7956 KB Output is correct
106 Correct 284 ms 264824 KB Output is correct
107 Correct 308 ms 264524 KB Output is correct
108 Correct 288 ms 264788 KB Output is correct
109 Correct 286 ms 264532 KB Output is correct
110 Correct 256 ms 264836 KB Output is correct
111 Correct 296 ms 264764 KB Output is correct
112 Correct 168 ms 8272 KB Output is correct
113 Correct 160 ms 8208 KB Output is correct
114 Correct 170 ms 7992 KB Output is correct
115 Correct 147 ms 7772 KB Output is correct
116 Correct 140 ms 7948 KB Output is correct
117 Correct 144 ms 7956 KB Output is correct
118 Correct 282 ms 264756 KB Output is correct
119 Correct 276 ms 264272 KB Output is correct
120 Correct 282 ms 265140 KB Output is correct
121 Correct 282 ms 264680 KB Output is correct
122 Correct 255 ms 264524 KB Output is correct
123 Correct 277 ms 264260 KB Output is correct
124 Correct 263 ms 264520 KB Output is correct
125 Correct 271 ms 264372 KB Output is correct
126 Correct 275 ms 264352 KB Output is correct