Submission #365930

#TimeUsernameProblemLanguageResultExecution timeMemory
365930Jarif_RahmanBitaro’s Party (JOI18_bitaro)C++17
14 / 100
172 ms14672 KiB
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int sq;
vector<bool> bl;
void merge(vector<pair<int, int>> &a, vector<pair<int, int>> &b){
    auto c = b;
    b.clear();
    for(auto p: a) c.pb(p);
    sort(c.rbegin(), c.rend());
    for(int i = 0; i < c.size(); i++){
        if(b.size() >= sq) break;
        if(b.empty()) b.pb(c[i]);
        if(b.back().sc == c[i].sc) continue;
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, q; cin >> n >> m >> q;
    bl.resize(n, 0);
    sq = sqrt(n+0.0);
    vector<vector<int>> v(n);
    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b; a--, b--;
        v[a].pb(b);
    }
    vector<vector<pair<int, int>>> dps(n);
    for(int i = 0; i < n; i++){
        auto mg = dps[i];
        for(auto &[c, nd]: mg) c++;
        mg.pb({1, i});
        for(int x: v[i]) merge(mg, dps[x]);
    }
    vector<bool> busy(n, 0);
    while(q--){
        int tj, yj; cin >> tj >> yj;
        tj--;
        vector<int> cbs(yj);
        for(int &x: cbs) cin >> x, x--, busy[x] = 1;
        if(yj <= sq){
            int ans = !busy[tj];
			ans--;
            for(auto [c, nd]: dps[tj]) if(!busy[nd]) ans = max(ans, c);
            cout << ans << "\n";
            for(int x: cbs) busy[x] = 0;
            continue;
        }
        vector<int> dp(n, -1);
        for(int i = 0; i < n; i++){
            if(busy[i] && dp[i] == -1) continue;
            dp[i] = max(dp[i], 0);
            for(int x: v[i]) dp[x] = max(dp[x], dp[i]+1);
        }
        cout << dp[tj] << "\n";
        for(int x: cbs) busy[x] = 0;
    }
}

Compilation message (stderr)

bitaro.cpp: In function 'void merge(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)':
bitaro.cpp:15:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i = 0; i < c.size(); i++){
      |                    ~~^~~~~~~~~~
bitaro.cpp:16:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |         if(b.size() >= sq) break;
      |            ~~~~~~~~~^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...