oj.uz

Submission #963289

# Submission time Handle Problem Language Result Execution time Memory
963289 2024-04-14T20:19:16 Z TimAni Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 48192 KB 
//start-time: 2024-04-14 19:39:32
#include <vector>
#include <set>
#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>

using namespace std;
using ll = long long;


void solve(){
    int n, m, q;
    cin >> n >> m >> q;
    const int w = round(sqrt(n));
    vector<vector<int>> gR(n);

    for(int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        u--; v--;
        gR[v].push_back(u);
    }
    
    vector<vector<array<int, 2>>> dp(n);

    vector<int> val(n, -1);
    set<array<int, 2>> aux;

    for(int u = 0; u < n; u++){
        val.assign(n, -1);
        aux.clear();
        aux.insert({0, u});
        val[u] = 0;

        for(auto v : gR[u]){
            for(auto [value, ind] : dp[v]){
                val[ind] = max(val[ind], value + 1);
            }
        }

        for(auto v : gR[u]){
            for(auto [value, ind] : dp[v]){
                aux.insert({val[ind], ind});
                if(aux.size() > w){
                    aux.erase(aux.begin());
                }
            }
        }

        dp[u] = vector<array<int, 2>>(aux.begin(), aux.end());
    }

    vector<bool> c(n);
    vector<int> naive(n);
    for(int i = 0; i < q; i++){
        c.assign(n, 0);
        int u, y;
        cin >> u >> y;
        u--;
        for(int j = 0; j < y; j++){
            int a; cin >> a;
            c[--a] = 1;
        }

        int ans = -1;

        if(y < w) {
            for(auto [v, i] : dp[u]){
                if(!c[i]){
                    ans = max(ans, v);
                }
            }
        }
        else {
            naive.assign(n, 0);
            for(int v = 0; v <= u; v++){
                naive[v] = c[v] ? -1 : 0;
                for(auto el : gR[v]){
                    naive[v] = max(naive[v], naive[el] + (naive[el] != -1));
                }
            }
            ans = naive[u];
        }

        cout << ans << endl;
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T = 1;
    //cin >> T;
    while(T--) solve();
    return 0;
}

Compilation message

bitaro.cpp: In function 'void solve()':
bitaro.cpp:46:31: warning: comparison of integer expressions of different signedness: 'std::set<std::array<int, 2> >::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare]
   46 |                 if(aux.size() > w){
      |                    ~~~~~~~~~~~^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 4 ms 600 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 5 ms 604 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 4 ms 604 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 4 ms 600 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 5 ms 604 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 4 ms 604 KB Output is correct
20 Correct 180 ms 2100 KB Output is correct
21 Correct 219 ms 1616 KB Output is correct
22 Correct 177 ms 1872 KB Output is correct
23 Correct 204 ms 2292 KB Output is correct
24 Execution timed out 2039 ms 48192 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 4 ms 600 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 5 ms 604 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 4 ms 604 KB Output is correct
20 Correct 180 ms 2100 KB Output is correct
21 Correct 219 ms 1616 KB Output is correct
22 Correct 177 ms 1872 KB Output is correct
23 Correct 204 ms 2292 KB Output is correct
24 Execution timed out 2039 ms 48192 KB Time limit exceeded
25 Halted 0 ms 0 KB -