oj.uz

Submission #201728

# Submission time Handle Problem Language Result Execution time Memory
201728 2020-02-11T20:34:43 Z Atill83 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1655 ms 210808 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m, q;
vector<int> adj2[MAXN];
vector<int> kisiler;
vector<pii> ans[MAXN];
bool visit[MAXN];
int d[MAXN];
const int sq = 150;



int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n>>m>>q;
    for(int i = 0; i < m; i++){
        int a, b;
        cin>>a>>b;
        adj2[b].push_back(a);
    }

    for(int i = 1; i <= n; i++){
        for(int &j: adj2[i]){
            for(pii u: ans[j]){
                d[u.ss] = max(d[u.ss], u.ff + 1);
            }
        }
        for(int &j: adj2[i]){
            for(pii &u: ans[j]){
                if(d[u.ss] != -1){
                    ans[i].push_back({d[u.ss], u.ss});
                    d[u.ss] = -1;
                }
            }
        }
        ans[i].push_back({0, i});
        sort(ans[i].begin(), ans[i].end(), greater<pii>());
        while(ans[i].size() > sq){
            ans[i].pop_back();
        }
    }


    for(int i = 0; i < q; i++){
        int x;
        int k;
        cin>>x>>k;
        
        vector<int> kisi(k);
        for(int j = 0; j < k; j++){
            cin>>kisi[j];
            visit[kisi[j]] = 1;
        }
        if(k >= sq){
            for(int i = 1; i < x; i++) d[i] = -mod;
            d[x] = 0;
            int res = -1;
            for(int i = x; i >= 1; i--){
                if(d[i] < 0) continue;
                if(d[i] > res && !visit[i]) res = d[i];
                for(int &j: adj2[i]) d[j] = max(d[j], d[i] + 1);
            }
            cout<<res<<endl;
        }else{
            int res = -1;
            for(int i = 0; i < ans[x].size(); i++){
                if(visit[ans[x][i].ss]) continue;
                res = ans[x][i].ff;
                break;
            }
            cout<<res<<endl;
        }
        for(int j: kisi) visit[j] = 0;
    }
    

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:84:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < ans[x].size(); i++){
                            ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 10 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 15 ms 6904 KB Output is correct
9 Correct 15 ms 6904 KB Output is correct
10 Correct 15 ms 6904 KB Output is correct
11 Correct 14 ms 6776 KB Output is correct
12 Correct 14 ms 6140 KB Output is correct
13 Correct 16 ms 6776 KB Output is correct
14 Correct 14 ms 6136 KB Output is correct
15 Correct 13 ms 5752 KB Output is correct
16 Correct 13 ms 6136 KB Output is correct
17 Correct 14 ms 6392 KB Output is correct
18 Correct 13 ms 6008 KB Output is correct
19 Correct 14 ms 6392 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 10 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 15 ms 6904 KB Output is correct
9 Correct 15 ms 6904 KB Output is correct
10 Correct 15 ms 6904 KB Output is correct
11 Correct 14 ms 6776 KB Output is correct
12 Correct 14 ms 6140 KB Output is correct
13 Correct 16 ms 6776 KB Output is correct
14 Correct 14 ms 6136 KB Output is correct
15 Correct 13 ms 5752 KB Output is correct
16 Correct 13 ms 6136 KB Output is correct
17 Correct 14 ms 6392 KB Output is correct
18 Correct 13 ms 6008 KB Output is correct
19 Correct 14 ms 6392 KB Output is correct
20 Correct 167 ms 8056 KB Output is correct
21 Correct 165 ms 8056 KB Output is correct
22 Correct 170 ms 8056 KB Output is correct
23 Correct 174 ms 8056 KB Output is correct
24 Correct 1058 ms 155596 KB Output is correct
25 Correct 1057 ms 156792 KB Output is correct
26 Correct 1065 ms 157432 KB Output is correct
27 Correct 811 ms 210544 KB Output is correct
28 Correct 811 ms 210680 KB Output is correct
29 Correct 809 ms 210552 KB Output is correct
30 Correct 848 ms 210424 KB Output is correct
31 Correct 1010 ms 207992 KB Output is correct
32 Correct 828 ms 210296 KB Output is correct
33 Correct 653 ms 132728 KB Output is correct
34 Correct 921 ms 153332 KB Output is correct
35 Correct 653 ms 131788 KB Output is correct
36 Correct 768 ms 171896 KB Output is correct
37 Correct 1035 ms 165896 KB Output is correct
38 Correct 789 ms 172236 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 10 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 15 ms 6904 KB Output is correct
9 Correct 15 ms 6904 KB Output is correct
10 Correct 15 ms 6904 KB Output is correct
11 Correct 14 ms 6776 KB Output is correct
12 Correct 14 ms 6140 KB Output is correct
13 Correct 16 ms 6776 KB Output is correct
14 Correct 14 ms 6136 KB Output is correct
15 Correct 13 ms 5752 KB Output is correct
16 Correct 13 ms 6136 KB Output is correct
17 Correct 14 ms 6392 KB Output is correct
18 Correct 13 ms 6008 KB Output is correct
19 Correct 14 ms 6392 KB Output is correct
20 Correct 167 ms 8056 KB Output is correct
21 Correct 165 ms 8056 KB Output is correct
22 Correct 170 ms 8056 KB Output is correct
23 Correct 174 ms 8056 KB Output is correct
24 Correct 1058 ms 155596 KB Output is correct
25 Correct 1057 ms 156792 KB Output is correct
26 Correct 1065 ms 157432 KB Output is correct
27 Correct 811 ms 210544 KB Output is correct
28 Correct 811 ms 210680 KB Output is correct
29 Correct 809 ms 210552 KB Output is correct
30 Correct 848 ms 210424 KB Output is correct
31 Correct 1010 ms 207992 KB Output is correct
32 Correct 828 ms 210296 KB Output is correct
33 Correct 653 ms 132728 KB Output is correct
34 Correct 921 ms 153332 KB Output is correct
35 Correct 653 ms 131788 KB Output is correct
36 Correct 768 ms 171896 KB Output is correct
37 Correct 1035 ms 165896 KB Output is correct
38 Correct 789 ms 172236 KB Output is correct
39 Correct 1221 ms 156796 KB Output is correct
40 Correct 1086 ms 155512 KB Output is correct
41 Correct 1097 ms 156448 KB Output is correct
42 Correct 1160 ms 156400 KB Output is correct
43 Correct 1177 ms 156696 KB Output is correct
44 Correct 211 ms 8440 KB Output is correct
45 Correct 176 ms 8056 KB Output is correct
46 Correct 178 ms 8032 KB Output is correct
47 Correct 208 ms 7968 KB Output is correct
48 Correct 166 ms 8012 KB Output is correct
49 Correct 991 ms 210652 KB Output is correct
50 Correct 934 ms 210012 KB Output is correct
51 Correct 206 ms 8368 KB Output is correct
52 Correct 188 ms 8056 KB Output is correct
53 Correct 940 ms 171380 KB Output is correct
54 Correct 1166 ms 163872 KB Output is correct
55 Correct 875 ms 171084 KB Output is correct
56 Correct 1153 ms 167704 KB Output is correct
57 Correct 211 ms 8572 KB Output is correct
58 Correct 204 ms 8440 KB Output is correct
59 Correct 173 ms 8056 KB Output is correct
60 Correct 173 ms 8044 KB Output is correct
61 Correct 1085 ms 210528 KB Output is correct
62 Correct 966 ms 171800 KB Output is correct
63 Correct 1135 ms 163532 KB Output is correct
64 Correct 1356 ms 210484 KB Output is correct
65 Correct 1114 ms 171288 KB Output is correct
66 Correct 1268 ms 164508 KB Output is correct
67 Correct 1655 ms 210492 KB Output is correct
68 Correct 1243 ms 171828 KB Output is correct
69 Correct 1341 ms 164008 KB Output is correct
70 Correct 882 ms 210588 KB Output is correct
71 Correct 829 ms 171768 KB Output is correct
72 Correct 1069 ms 164152 KB Output is correct
73 Correct 924 ms 210472 KB Output is correct
74 Correct 843 ms 171640 KB Output is correct
75 Correct 1049 ms 165880 KB Output is correct
76 Correct 920 ms 210808 KB Output is correct
77 Correct 1207 ms 210552 KB Output is correct
78 Correct 885 ms 210592 KB Output is correct
79 Correct 200 ms 8568 KB Output is correct
80 Correct 237 ms 8060 KB Output is correct
81 Correct 163 ms 8056 KB Output is correct
82 Correct 960 ms 210680 KB Output is correct
83 Correct 1188 ms 208120 KB Output is correct
84 Correct 1153 ms 210680 KB Output is correct
85 Correct 1313 ms 209352 KB Output is correct
86 Correct 936 ms 210680 KB Output is correct
87 Correct 1128 ms 208376 KB Output is correct
88 Correct 196 ms 8440 KB Output is correct
89 Correct 200 ms 8440 KB Output is correct
90 Correct 243 ms 8056 KB Output is correct
91 Correct 251 ms 8056 KB Output is correct
92 Correct 168 ms 8184 KB Output is correct
93 Correct 166 ms 8056 KB Output is correct
94 Correct 751 ms 133336 KB Output is correct
95 Correct 1051 ms 162168 KB Output is correct
96 Correct 878 ms 132216 KB Output is correct
97 Correct 1126 ms 163320 KB Output is correct
98 Correct 708 ms 132728 KB Output is correct
99 Correct 979 ms 158712 KB Output is correct
100 Correct 207 ms 8572 KB Output is correct
101 Correct 211 ms 8440 KB Output is correct
102 Correct 227 ms 8056 KB Output is correct
103 Correct 234 ms 7940 KB Output is correct
104 Correct 170 ms 8056 KB Output is correct
105 Correct 172 ms 8056 KB Output is correct
106 Correct 892 ms 171676 KB Output is correct
107 Correct 1131 ms 165624 KB Output is correct
108 Correct 996 ms 172280 KB Output is correct
109 Correct 1127 ms 163704 KB Output is correct
110 Correct 854 ms 172460 KB Output is correct
111 Correct 1064 ms 163960 KB Output is correct
112 Correct 209 ms 8440 KB Output is correct
113 Correct 218 ms 8504 KB Output is correct
114 Correct 233 ms 8056 KB Output is correct
115 Correct 258 ms 8056 KB Output is correct
116 Correct 164 ms 8012 KB Output is correct
117 Correct 165 ms 8052 KB Output is correct
118 Correct 952 ms 210056 KB Output is correct
119 Correct 877 ms 171964 KB Output is correct
120 Correct 1133 ms 165448 KB Output is correct
121 Correct 929 ms 210092 KB Output is correct
122 Correct 888 ms 171276 KB Output is correct
123 Correct 1141 ms 165172 KB Output is correct
124 Correct 919 ms 210296 KB Output is correct
125 Correct 868 ms 174836 KB Output is correct
126 Correct 1104 ms 167788 KB Output is correct