Submission #1096224

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096224		Zero_OP	Bitaro’s Party (JOI18_bitaro)	C++17	7 / 100	1295 ms	524288 KiB

bitaro

#include "bits/stdc++.h"

using namespace std;

#define sz(v) (int)v.size()
#define all(v) begin(v), end(v)
#define compact(v) v.erase(unique(all(v)), end(v))

const int MAX = 1e5 + 5;
int SQRT = 350;

int n, m, q, f[MAX];
vector<int> rev[MAX];
vector<pair<int, int>> dp[MAX], best[MAX]; //[dist, u]
bool bad[MAX];
bool vis[MAX];

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

    if(fopen("task.inp", "r")){
        freopen("task.inp", "r", stdin);
//        freopen("task.out", "w", stdout);
    }

    cin >> n >> m >> q;
    for(int i = 0; i < m; ++i){
        int u, v;
        cin >> u >> v;
        rev[v].push_back(u);
    }

    for(int i = 1; i <= n; ++i){
        sort(all(rev[i]));
        compact(rev[i]);
    }

    SQRT = sqrt(n);
    for(int i = 1; i <= n; ++i){
        dp[i].push_back({-1, i});
        for(int j : rev[i]){
            dp[i].insert(dp[i].end(), all(dp[j]));
        }

        sort(all(dp[i]), greater<pair<int, int>>());
        for(int j = 0; j < sz(dp[i]) && sz(best[i]) < SQRT + 5; ++j){
            if(!vis[dp[i][j].second]){
                vis[dp[i][j].second] = true;
                best[i].push_back(dp[i][j]);
                ++best[i].back().first;
            }
        }

        for(auto [d, u] : best[i]){
            vis[u] = false;
        }

        dp[i] = best[i];
    }

//    return 0;

//    for(int i = 1; i <= n; ++i){
//        cout << i << " :\n";
//        for(auto j : best[i]) cout << j.first << ' ' << j.second << '\n'; cout << '\n';
//    }

    while(q--){
        int t, y;
        cin >> t >> y;

        vector<int> nodes(y);
        for(int i = 0; i < y; ++i) cin >> nodes[i];

        for(int u : nodes) bad[u] = true;

        if(y > SQRT){
//            cout << "heavy\n";
            fill(f + 1, f + 1 + n, -1e9);
            f[t] = 0;

            for(int i = t; i > 0; --i){
                for(int j : rev[i]){
                    f[j] = max(f[j], f[i] + 1);
                }
            }

            int ans = -1;
            for(int i = t; i > 0; --i){
                if(!bad[i]) ans = max(ans, f[i]);
            }

            cout << ans << '\n';
        } else{
//            cout << "light\n";
            int ans = -1;
            for(auto u : best[t]){
                if(!bad[u.second]){
                    ans = u.first;
                    break;
                }
            }

            if(ans == -1){
                cout << ans << '\n';
            } else{
                cout << ans << '\n';
            }
        }

        for(int u : nodes) bad[u] = false;
    }

    return 0;
}

Compilation message (stderr)

bitaro.cpp: In function 'int main()':
bitaro.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen("task.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86