oj.uz

Submission #566770

# Submission time Handle Problem Language Result Execution time Memory
566770 2022-05-22T20:14:54 Z milisav Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1190 ms 140900 KB 
#include<bits/stdc++.h>
#define maxn 300000
#define blk 150
using namespace std;
int n,m,q;
vector<int> a[maxn];
vector<int> b[maxn];
int city[maxn][blk];
int dist[maxn][blk];
int it[maxn];
int sz[maxn];
int c[maxn];
int ch[maxn];
bool fnd[maxn];
vector<int> topo;
priority_queue<pair<int,int> > pq;

bool ok[maxn];

void calc_small() {
    for(int iter=0;iter<n;iter++) {
        int u=topo[iter];
        pq.push({0,u});
        for(int i=0;i<b[u].size();i++) {
            it[b[u][i]]=0;
            pq.push({1+dist[b[u][i]][it[b[u][i]]],b[u][i]});
        }
        while(sz[u]<blk && !pq.empty()) {
            int d=pq.top().first;
            int nd=pq.top().second;
            pq.pop();
            int v=u;
            if(nd!=u) {
                v=city[nd][it[nd]];
                it[nd]++;
                if(it[nd]<sz[nd]) pq.push({1+dist[nd][it[nd]],nd});
            }
            if(!fnd[v]) {
                fnd[v]=true;
                dist[u][sz[u]]=d;
                city[u][sz[u]]=v;
                sz[u]++;
            }
        }
        while(!pq.empty()) pq.pop();
        for(int i=0;i<sz[u];i++) fnd[city[u][i]]=false;
    }
}

int dst[maxn];
int calc_big(int t) {
    for(int i=1;i<=n;i++) dst[i]=-1;
    for(int iter=0;iter<n;iter++) {
        int u=topo[iter];
        if(ok[u]) dst[u]=0;
        for(auto v:b[u]) {
            if(dst[v]!=-1) dst[u]=max(dst[u],dst[v]+1);
        }
        if(u==t) return dst[u];
    }
    return -1;
}

int main() {
    scanf("%d %d %d",&n,&m,&q);
    for(int i=0;i<m;i++) {
        int s,e;
        scanf("%d %d",&s,&e);
        a[s].push_back(e);
        b[e].push_back(s);
        ch[e]++;
    }

    for(int i=1;i<=n;i++) {
        ok[i]=true;
        if(ch[i]==0) topo.push_back(i);
    }
    int iter=0;
    while(iter<topo.size()) {
        int u=topo[iter];
        for(auto v:a[u]) {
            ch[v]--;
            if(ch[v]==0) topo.push_back(v);
        }
        iter++;
    }

    calc_small();

    /*for(int i=1;i<=n;i++) {
        printf("%d %d\n",i,sz[i]);
        for(int j=0;j<sz[i];j++) {
            printf("\t%d %d\n",city[i][j],dist[i][j]);
        }
    }*/

    for(int i=0;i<q;i++) {
        int t,y;
        scanf("%d %d",&t,&y);
        for(int j=0;j<y;j++) {
            scanf("%d",&c[j]);
            ok[c[j]]=false;
        }

        if(y<blk) {
            int ans=-1;
            for(int j=0;j<sz[t];j++) {
                if(ok[city[t][j]]) {
                    ans=dist[t][j];
                    break;
                }
            }
            printf("%d\n",ans);
        }
        else {
            printf("%d\n",calc_big(t));
        }

        for(int j=0;j<y;j++) {
            ok[c[j]]=true;
        }
    }

    return 0;
}

Compilation message

bitaro.cpp: In function 'void calc_small()':
bitaro.cpp:24:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for(int i=0;i<b[u].size();i++) {
      |                     ~^~~~~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:79:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     while(iter<topo.size()) {
      |           ~~~~^~~~~~~~~~~~
bitaro.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     scanf("%d %d %d",&n,&m,&q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         scanf("%d %d",&s,&e);
      |         ~~~~~^~~~~~~~~~~~~~~
bitaro.cpp:99:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |         scanf("%d %d",&t,&y);
      |         ~~~~~^~~~~~~~~~~~~~~
bitaro.cpp:101:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |             scanf("%d",&c[j]);
      |             ~~~~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14444 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 11 ms 15700 KB Output is correct
6 Correct 10 ms 15700 KB Output is correct
7 Correct 11 ms 15708 KB Output is correct
8 Correct 13 ms 15688 KB Output is correct
9 Correct 13 ms 15676 KB Output is correct
10 Correct 13 ms 15728 KB Output is correct
11 Correct 13 ms 15700 KB Output is correct
12 Correct 12 ms 15700 KB Output is correct
13 Correct 14 ms 15604 KB Output is correct
14 Correct 11 ms 15700 KB Output is correct
15 Correct 10 ms 15700 KB Output is correct
16 Correct 12 ms 15700 KB Output is correct
17 Correct 14 ms 15624 KB Output is correct
18 Correct 11 ms 15700 KB Output is correct
19 Correct 12 ms 15700 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14444 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 11 ms 15700 KB Output is correct
6 Correct 10 ms 15700 KB Output is correct
7 Correct 11 ms 15708 KB Output is correct
8 Correct 13 ms 15688 KB Output is correct
9 Correct 13 ms 15676 KB Output is correct
10 Correct 13 ms 15728 KB Output is correct
11 Correct 13 ms 15700 KB Output is correct
12 Correct 12 ms 15700 KB Output is correct
13 Correct 14 ms 15604 KB Output is correct
14 Correct 11 ms 15700 KB Output is correct
15 Correct 10 ms 15700 KB Output is correct
16 Correct 12 ms 15700 KB Output is correct
17 Correct 14 ms 15624 KB Output is correct
18 Correct 11 ms 15700 KB Output is correct
19 Correct 12 ms 15700 KB Output is correct
20 Correct 548 ms 18156 KB Output is correct
21 Correct 358 ms 18112 KB Output is correct
22 Correct 533 ms 18324 KB Output is correct
23 Correct 237 ms 18128 KB Output is correct
24 Correct 624 ms 139544 KB Output is correct
25 Correct 636 ms 139528 KB Output is correct
26 Correct 622 ms 139396 KB Output is correct
27 Correct 545 ms 140900 KB Output is correct
28 Correct 561 ms 140864 KB Output is correct
29 Correct 570 ms 140792 KB Output is correct
30 Correct 608 ms 140144 KB Output is correct
31 Correct 593 ms 140172 KB Output is correct
32 Correct 562 ms 140076 KB Output is correct
33 Correct 434 ms 140272 KB Output is correct
34 Correct 413 ms 140148 KB Output is correct
35 Correct 428 ms 140228 KB Output is correct
36 Correct 523 ms 140568 KB Output is correct
37 Correct 539 ms 140396 KB Output is correct
38 Correct 520 ms 140420 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14444 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 11 ms 15700 KB Output is correct
6 Correct 10 ms 15700 KB Output is correct
7 Correct 11 ms 15708 KB Output is correct
8 Correct 13 ms 15688 KB Output is correct
9 Correct 13 ms 15676 KB Output is correct
10 Correct 13 ms 15728 KB Output is correct
11 Correct 13 ms 15700 KB Output is correct
12 Correct 12 ms 15700 KB Output is correct
13 Correct 14 ms 15604 KB Output is correct
14 Correct 11 ms 15700 KB Output is correct
15 Correct 10 ms 15700 KB Output is correct
16 Correct 12 ms 15700 KB Output is correct
17 Correct 14 ms 15624 KB Output is correct
18 Correct 11 ms 15700 KB Output is correct
19 Correct 12 ms 15700 KB Output is correct
20 Correct 548 ms 18156 KB Output is correct
21 Correct 358 ms 18112 KB Output is correct
22 Correct 533 ms 18324 KB Output is correct
23 Correct 237 ms 18128 KB Output is correct
24 Correct 624 ms 139544 KB Output is correct
25 Correct 636 ms 139528 KB Output is correct
26 Correct 622 ms 139396 KB Output is correct
27 Correct 545 ms 140900 KB Output is correct
28 Correct 561 ms 140864 KB Output is correct
29 Correct 570 ms 140792 KB Output is correct
30 Correct 608 ms 140144 KB Output is correct
31 Correct 593 ms 140172 KB Output is correct
32 Correct 562 ms 140076 KB Output is correct
33 Correct 434 ms 140272 KB Output is correct
34 Correct 413 ms 140148 KB Output is correct
35 Correct 428 ms 140228 KB Output is correct
36 Correct 523 ms 140568 KB Output is correct
37 Correct 539 ms 140396 KB Output is correct
38 Correct 520 ms 140420 KB Output is correct
39 Correct 659 ms 139212 KB Output is correct
40 Correct 641 ms 138928 KB Output is correct
41 Correct 668 ms 139012 KB Output is correct
42 Correct 746 ms 139400 KB Output is correct
43 Correct 630 ms 139292 KB Output is correct
44 Correct 592 ms 18552 KB Output is correct
45 Correct 541 ms 18308 KB Output is correct
46 Correct 555 ms 18128 KB Output is correct
47 Correct 575 ms 18180 KB Output is correct
48 Correct 548 ms 18212 KB Output is correct
49 Correct 609 ms 140900 KB Output is correct
50 Correct 552 ms 140200 KB Output is correct
51 Correct 417 ms 18488 KB Output is correct
52 Correct 375 ms 18084 KB Output is correct
53 Correct 556 ms 140240 KB Output is correct
54 Correct 564 ms 140068 KB Output is correct
55 Correct 517 ms 139840 KB Output is correct
56 Correct 522 ms 139856 KB Output is correct
57 Correct 548 ms 18572 KB Output is correct
58 Correct 577 ms 18528 KB Output is correct
59 Correct 520 ms 18164 KB Output is correct
60 Correct 534 ms 18152 KB Output is correct
61 Correct 634 ms 140624 KB Output is correct
62 Correct 631 ms 140216 KB Output is correct
63 Correct 649 ms 140132 KB Output is correct
64 Correct 863 ms 140688 KB Output is correct
65 Correct 819 ms 140312 KB Output is correct
66 Correct 840 ms 140232 KB Output is correct
67 Correct 981 ms 140772 KB Output is correct
68 Correct 1043 ms 140308 KB Output is correct
69 Correct 1190 ms 140140 KB Output is correct
70 Correct 570 ms 140612 KB Output is correct
71 Correct 511 ms 140160 KB Output is correct
72 Correct 530 ms 140260 KB Output is correct
73 Correct 581 ms 140772 KB Output is correct
74 Correct 543 ms 140176 KB Output is correct
75 Correct 546 ms 140236 KB Output is correct
76 Correct 586 ms 140868 KB Output is correct
77 Correct 749 ms 140720 KB Output is correct
78 Correct 558 ms 140868 KB Output is correct
79 Correct 399 ms 18476 KB Output is correct
80 Correct 428 ms 18136 KB Output is correct
81 Correct 369 ms 18124 KB Output is correct
82 Correct 591 ms 140104 KB Output is correct
83 Correct 612 ms 140080 KB Output is correct
84 Correct 757 ms 140000 KB Output is correct
85 Correct 904 ms 139960 KB Output is correct
86 Correct 579 ms 140220 KB Output is correct
87 Correct 612 ms 139992 KB Output is correct
88 Correct 540 ms 18636 KB Output is correct
89 Correct 602 ms 18580 KB Output is correct
90 Correct 596 ms 18144 KB Output is correct
91 Correct 622 ms 18360 KB Output is correct
92 Correct 554 ms 18252 KB Output is correct
93 Correct 572 ms 18168 KB Output is correct
94 Correct 482 ms 140068 KB Output is correct
95 Correct 459 ms 139824 KB Output is correct
96 Correct 653 ms 140164 KB Output is correct
97 Correct 644 ms 140048 KB Output is correct
98 Correct 457 ms 140100 KB Output is correct
99 Correct 428 ms 140116 KB Output is correct
100 Correct 325 ms 18432 KB Output is correct
101 Correct 280 ms 18476 KB Output is correct
102 Correct 360 ms 18128 KB Output is correct
103 Correct 317 ms 18164 KB Output is correct
104 Correct 299 ms 18220 KB Output is correct
105 Correct 269 ms 18200 KB Output is correct
106 Correct 557 ms 140196 KB Output is correct
107 Correct 564 ms 140104 KB Output is correct
108 Correct 748 ms 140228 KB Output is correct
109 Correct 796 ms 140232 KB Output is correct
110 Correct 561 ms 140356 KB Output is correct
111 Correct 562 ms 140232 KB Output is correct
112 Correct 538 ms 18592 KB Output is correct
113 Correct 592 ms 18548 KB Output is correct
114 Correct 586 ms 18228 KB Output is correct
115 Correct 635 ms 18084 KB Output is correct
116 Correct 524 ms 18248 KB Output is correct
117 Correct 579 ms 18068 KB Output is correct
118 Correct 560 ms 140256 KB Output is correct
119 Correct 514 ms 139820 KB Output is correct
120 Correct 518 ms 139796 KB Output is correct
121 Correct 547 ms 140408 KB Output is correct
122 Correct 510 ms 139860 KB Output is correct
123 Correct 517 ms 139940 KB Output is correct
124 Correct 557 ms 140348 KB Output is correct
125 Correct 511 ms 139824 KB Output is correct
126 Correct 536 ms 139800 KB Output is correct