oj.uz

Submission #410944

# Submission time Handle Problem Language Result Execution time Memory
410944 2021-05-23T23:05:31 Z azberjibiou Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 710 ms 92864 KB 
#include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define bp __builtin_popcount
#define fir first
#define sec second
#define pii pair<int, int>
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
int dx[4]={0, 1, 0, -1}, dy[4]={1, 0, -1 , 0};
const int mxN=100010;
const int mxM=100;
const int mxK=100;
const ll MOD=1000000007;
const ll INF=100000000000001;
int N, M, Q;
vector <int> v[mxN], rv[mxN];
int deg[mxN];
vector <pii> num[mxN];
vector <pii> tmpv1, tmpv2, tmpv3;
int Chk[mxN];
int idx=1;
int dp[mxN];
int main()
{
    gibon
    cin >> N >> M >> Q;
    for(int i=1;i<=M;i++)
    {
        int a, b;
        cin >> a >> b;
        v[b].push_back(a);
    }
    for(int now=1;now<=N;now++)
    {
        tmpv3.clear();
        tmpv3.push_back({now, 0});
        for(int nxt : v[now])
        {
            tmpv1.clear();
            swap(tmpv1, tmpv3);
            tmpv2.clear();  tmpv2.resize(num[nxt].size());  for(int i=0;i<num[nxt].size();i++)  tmpv2[i]=num[nxt][i];
            for(int i=0;i<tmpv2.size();i++) tmpv2[i].sec++;
            int cur1=0, cur2=0;
            while(cur1!=tmpv1.size() && cur2!=tmpv2.size() && tmpv3.size()<=mxK)
            {
                if(tmpv1[cur1].sec>tmpv2[cur2].sec)
                {
                    if(Chk[tmpv1[cur1].fir]==idx)   cur1++;
                    else
                    {
                        tmpv3.push_back(tmpv1[cur1]);
                        Chk[tmpv1[cur1++].fir]=idx;
                    }
                }
                else
                {
                    if(Chk[tmpv2[cur2].fir]==idx)   cur2++;
                    else
                    {
                        tmpv3.push_back(tmpv2[cur2]);
                        Chk[tmpv2[cur2++].fir]=idx;
                    }
                }
            }
            while(tmpv3.size()<=mxK && cur1!=tmpv1.size())
            {
                if(Chk[tmpv1[cur1].fir]==idx)   cur1++;
                else    tmpv3.push_back(tmpv1[cur1++]);
            }
            while(tmpv3.size()<=mxK && cur2!=tmpv2.size())
            {
                if(Chk[tmpv2[cur2].fir]==idx)   cur2++;
                else    tmpv3.push_back(tmpv2[cur2++]);
            }
            idx++;
        }
        num[now].resize(tmpv3.size());  for(int i=0;i<tmpv3.size();i++) num[now][i]=tmpv3[i];
    }
    while(Q--)
    {
        int ans=-1;
        int T, Y;
        cin >> T >> Y;
        for(int i=0;i<Y;i++)
        {
            int a;  cin >> a;
            Chk[a]=idx;
        }
        if(Y<mxK)
        {
            for(pii nxt : num[T])   if(Chk[nxt.fir]!=idx)
            {
                ans=nxt.sec;
                break;
            }
            cout << ans << '\n';
        }
        else
        {
            for(int i=1;i<=T;i++)   dp[i]=-1;
            for(int now=1;now<=T;now++)
            {
                if(Chk[now]!=idx)   dp[now]=0;
                for(int nxt : v[now])   if(dp[nxt]!=-1)
                {
                    dp[now]=max(dp[now], dp[nxt]+1);
                }
            }
            cout << dp[T] << '\n';
        }
        idx++;
    }
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:45:74: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             tmpv2.clear();  tmpv2.resize(num[nxt].size());  for(int i=0;i<num[nxt].size();i++)  tmpv2[i]=num[nxt][i];
      |                                                                         ~^~~~~~~~~~~~~~~~
bitaro.cpp:46:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |             for(int i=0;i<tmpv2.size();i++) tmpv2[i].sec++;
      |                         ~^~~~~~~~~~~~~
bitaro.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             while(cur1!=tmpv1.size() && cur2!=tmpv2.size() && tmpv3.size()<=mxK)
      |                   ~~~~^~~~~~~~~~~~~~
bitaro.cpp:48:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             while(cur1!=tmpv1.size() && cur2!=tmpv2.size() && tmpv3.size()<=mxK)
      |                                         ~~~~^~~~~~~~~~~~~~
bitaro.cpp:69:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |             while(tmpv3.size()<=mxK && cur1!=tmpv1.size())
      |                                        ~~~~^~~~~~~~~~~~~~
bitaro.cpp:74:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             while(tmpv3.size()<=mxK && cur2!=tmpv2.size())
      |                                        ~~~~^~~~~~~~~~~~~~
bitaro.cpp:81:54: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         num[now].resize(tmpv3.size());  for(int i=0;i<tmpv3.size();i++) num[now][i]=tmpv3[i];
      |                                                     ~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 5 ms 7244 KB Output is correct
3 Correct 5 ms 7244 KB Output is correct
4 Correct 5 ms 7272 KB Output is correct
5 Correct 7 ms 7628 KB Output is correct
6 Correct 7 ms 7684 KB Output is correct
7 Correct 7 ms 7628 KB Output is correct
8 Correct 7 ms 8140 KB Output is correct
9 Correct 9 ms 8140 KB Output is correct
10 Correct 8 ms 8140 KB Output is correct
11 Correct 8 ms 8140 KB Output is correct
12 Correct 7 ms 7888 KB Output is correct
13 Correct 7 ms 8012 KB Output is correct
14 Correct 7 ms 7756 KB Output is correct
15 Correct 7 ms 7628 KB Output is correct
16 Correct 7 ms 7740 KB Output is correct
17 Correct 7 ms 7884 KB Output is correct
18 Correct 7 ms 7756 KB Output is correct
19 Correct 7 ms 7884 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 5 ms 7244 KB Output is correct
3 Correct 5 ms 7244 KB Output is correct
4 Correct 5 ms 7272 KB Output is correct
5 Correct 7 ms 7628 KB Output is correct
6 Correct 7 ms 7684 KB Output is correct
7 Correct 7 ms 7628 KB Output is correct
8 Correct 7 ms 8140 KB Output is correct
9 Correct 9 ms 8140 KB Output is correct
10 Correct 8 ms 8140 KB Output is correct
11 Correct 8 ms 8140 KB Output is correct
12 Correct 7 ms 7888 KB Output is correct
13 Correct 7 ms 8012 KB Output is correct
14 Correct 7 ms 7756 KB Output is correct
15 Correct 7 ms 7628 KB Output is correct
16 Correct 7 ms 7740 KB Output is correct
17 Correct 7 ms 7884 KB Output is correct
18 Correct 7 ms 7756 KB Output is correct
19 Correct 7 ms 7884 KB Output is correct
20 Correct 178 ms 9276 KB Output is correct
21 Correct 177 ms 9392 KB Output is correct
22 Correct 179 ms 9284 KB Output is correct
23 Correct 178 ms 9284 KB Output is correct
24 Correct 326 ms 70960 KB Output is correct
25 Correct 333 ms 72176 KB Output is correct
26 Correct 328 ms 72008 KB Output is correct
27 Correct 307 ms 90968 KB Output is correct
28 Correct 302 ms 90996 KB Output is correct
29 Correct 304 ms 90892 KB Output is correct
30 Correct 306 ms 90680 KB Output is correct
31 Correct 310 ms 89300 KB Output is correct
32 Correct 307 ms 90656 KB Output is correct
33 Correct 248 ms 60772 KB Output is correct
34 Correct 250 ms 55236 KB Output is correct
35 Correct 246 ms 60484 KB Output is correct
36 Correct 296 ms 75892 KB Output is correct
37 Correct 283 ms 71880 KB Output is correct
38 Correct 289 ms 75892 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 5 ms 7244 KB Output is correct
3 Correct 5 ms 7244 KB Output is correct
4 Correct 5 ms 7272 KB Output is correct
5 Correct 7 ms 7628 KB Output is correct
6 Correct 7 ms 7684 KB Output is correct
7 Correct 7 ms 7628 KB Output is correct
8 Correct 7 ms 8140 KB Output is correct
9 Correct 9 ms 8140 KB Output is correct
10 Correct 8 ms 8140 KB Output is correct
11 Correct 8 ms 8140 KB Output is correct
12 Correct 7 ms 7888 KB Output is correct
13 Correct 7 ms 8012 KB Output is correct
14 Correct 7 ms 7756 KB Output is correct
15 Correct 7 ms 7628 KB Output is correct
16 Correct 7 ms 7740 KB Output is correct
17 Correct 7 ms 7884 KB Output is correct
18 Correct 7 ms 7756 KB Output is correct
19 Correct 7 ms 7884 KB Output is correct
20 Correct 178 ms 9276 KB Output is correct
21 Correct 177 ms 9392 KB Output is correct
22 Correct 179 ms 9284 KB Output is correct
23 Correct 178 ms 9284 KB Output is correct
24 Correct 326 ms 70960 KB Output is correct
25 Correct 333 ms 72176 KB Output is correct
26 Correct 328 ms 72008 KB Output is correct
27 Correct 307 ms 90968 KB Output is correct
28 Correct 302 ms 90996 KB Output is correct
29 Correct 304 ms 90892 KB Output is correct
30 Correct 306 ms 90680 KB Output is correct
31 Correct 310 ms 89300 KB Output is correct
32 Correct 307 ms 90656 KB Output is correct
33 Correct 248 ms 60772 KB Output is correct
34 Correct 250 ms 55236 KB Output is correct
35 Correct 246 ms 60484 KB Output is correct
36 Correct 296 ms 75892 KB Output is correct
37 Correct 283 ms 71880 KB Output is correct
38 Correct 289 ms 75892 KB Output is correct
39 Correct 375 ms 71240 KB Output is correct
40 Correct 333 ms 71620 KB Output is correct
41 Correct 710 ms 72060 KB Output is correct
42 Correct 422 ms 71992 KB Output is correct
43 Correct 334 ms 71620 KB Output is correct
44 Correct 212 ms 9684 KB Output is correct
45 Correct 191 ms 9404 KB Output is correct
46 Correct 351 ms 9328 KB Output is correct
47 Correct 213 ms 9288 KB Output is correct
48 Correct 182 ms 9380 KB Output is correct
49 Correct 350 ms 90948 KB Output is correct
50 Correct 685 ms 90816 KB Output is correct
51 Correct 205 ms 9636 KB Output is correct
52 Correct 362 ms 9268 KB Output is correct
53 Correct 329 ms 75776 KB Output is correct
54 Correct 335 ms 71996 KB Output is correct
55 Correct 671 ms 75928 KB Output is correct
56 Correct 674 ms 73772 KB Output is correct
57 Correct 210 ms 10840 KB Output is correct
58 Correct 212 ms 10728 KB Output is correct
59 Correct 372 ms 10564 KB Output is correct
60 Correct 369 ms 10248 KB Output is correct
61 Correct 378 ms 91832 KB Output is correct
62 Correct 358 ms 77180 KB Output is correct
63 Correct 365 ms 73196 KB Output is correct
64 Correct 535 ms 91928 KB Output is correct
65 Correct 514 ms 77608 KB Output is correct
66 Correct 510 ms 74180 KB Output is correct
67 Correct 680 ms 92496 KB Output is correct
68 Correct 649 ms 77764 KB Output is correct
69 Correct 660 ms 73284 KB Output is correct
70 Correct 318 ms 92352 KB Output is correct
71 Correct 298 ms 77452 KB Output is correct
72 Correct 310 ms 73608 KB Output is correct
73 Correct 339 ms 92364 KB Output is correct
74 Correct 319 ms 77668 KB Output is correct
75 Correct 316 ms 73704 KB Output is correct
76 Correct 358 ms 92864 KB Output is correct
77 Correct 682 ms 92768 KB Output is correct
78 Correct 317 ms 92720 KB Output is correct
79 Correct 208 ms 11420 KB Output is correct
80 Correct 336 ms 10936 KB Output is correct
81 Correct 178 ms 10836 KB Output is correct
82 Correct 364 ms 92740 KB Output is correct
83 Correct 356 ms 90952 KB Output is correct
84 Correct 647 ms 92680 KB Output is correct
85 Correct 682 ms 91004 KB Output is correct
86 Correct 320 ms 92436 KB Output is correct
87 Correct 327 ms 91096 KB Output is correct
88 Correct 215 ms 10948 KB Output is correct
89 Correct 214 ms 11088 KB Output is correct
90 Correct 353 ms 10724 KB Output is correct
91 Correct 353 ms 10700 KB Output is correct
92 Correct 181 ms 10640 KB Output is correct
93 Correct 184 ms 10632 KB Output is correct
94 Correct 298 ms 62532 KB Output is correct
95 Correct 294 ms 56208 KB Output is correct
96 Correct 572 ms 62352 KB Output is correct
97 Correct 576 ms 57396 KB Output is correct
98 Correct 268 ms 62528 KB Output is correct
99 Correct 260 ms 56936 KB Output is correct
100 Correct 215 ms 11116 KB Output is correct
101 Correct 215 ms 11088 KB Output is correct
102 Correct 297 ms 10700 KB Output is correct
103 Correct 297 ms 10784 KB Output is correct
104 Correct 182 ms 10640 KB Output is correct
105 Correct 180 ms 10612 KB Output is correct
106 Correct 337 ms 77268 KB Output is correct
107 Correct 335 ms 73620 KB Output is correct
108 Correct 647 ms 77736 KB Output is correct
109 Correct 658 ms 73416 KB Output is correct
110 Correct 299 ms 77636 KB Output is correct
111 Correct 299 ms 73772 KB Output is correct
112 Correct 216 ms 11004 KB Output is correct
113 Correct 213 ms 11072 KB Output is correct
114 Correct 340 ms 10608 KB Output is correct
115 Correct 351 ms 10568 KB Output is correct
116 Correct 181 ms 10636 KB Output is correct
117 Correct 182 ms 10680 KB Output is correct
118 Correct 318 ms 91972 KB Output is correct
119 Correct 291 ms 77212 KB Output is correct
120 Correct 287 ms 73080 KB Output is correct
121 Correct 311 ms 91820 KB Output is correct
122 Correct 294 ms 77192 KB Output is correct
123 Correct 292 ms 72932 KB Output is correct
124 Correct 309 ms 91844 KB Output is correct
125 Correct 295 ms 77360 KB Output is correct
126 Correct 286 ms 73028 KB Output is correct