oj.uz

Submission #172228

# Submission time Handle Problem Language Result Execution time Memory
172228 2019-12-31T17:53:33 Z arnold518 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1618 ms 111472 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int MAXM = 2e5;
const int SQ = 100;

int N, M, Q;
vector<int> adj[MAXN+10];
vector<pii> V[MAXN+10];

int T, Y, dp[MAXN+10];
int X[MAXN+10];

int main()
{
    int i, j, k;

    scanf("%d%d%d", &N, &M, &Q);
    for(i=1; i<=M; i++)
    {
        int u, v;
        scanf("%d%d", &u, &v);
        adj[v].push_back(u);
    }

    for(i=1; i<=N; i++)
    {
        V[i].push_back({0, i});
        for(auto nxt : adj[i])
        {
            vector<pii> t, p, q;
            for(auto it : V[nxt]) p.push_back({it.first+1, it.second});
            q=V[i];

            V[i].clear();

            for(j=0, k=0; V[i].size()<SQ && (j<p.size() || k<q.size()); )
            {
                if(j<p.size() && (k>=q.size() || p[j].first>q[k].first))
                {
                    if(!X[p[j].second])
                    {
                        X[p[j].second]=1;
                        V[i].push_back(p[j]);
                    }
                    j++;
                }
                else
                {
                    if(!X[q[k].second])
                    {
                        X[q[k].second]=1;
                        V[i].push_back(q[k]);
                    }
                    k++;
                }
            }

            for(j=0; j<p.size(); j++) X[p[j].second]=0;
            for(k=0; k<q.size(); k++) X[q[k].second]=0;
        }
        //printf("%d : ", i);
        //for(auto it : V[i]) printf("(%d %d) ", it.first, it.second);
        //printf("\n");
    }

    for(i=1; i<=Q; i++)
    {
        scanf("%d%d", &T, &Y);
        vector<int> p;

        for(j=1; j<=Y; j++)
        {
            int t;
            scanf("%d", &t);
            p.push_back(t);
            X[t]=1;
        }
        if(Y>=SQ)
        {
            for(j=1; j<=N; j++) dp[j]=-987654321;
            dp[T]=0;
            int ans=-1;
            for(j=T; j>=1; j--)
            {
                if(!X[j]) ans=max(ans, dp[j]);
                for(auto nxt : adj[j]) dp[nxt]=max(dp[nxt], dp[j]+1);
            }
            printf("%d\n", ans);
        }
        else
        {
            int ans=-1;
            for(auto it : V[T])
            {
                if(X[it.second]) continue;
                ans=it.first;
                break;
            }
            printf("%d\n", ans);
        }

        for(auto it : p) X[it]=0;
    }
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:42:47: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(j=0, k=0; V[i].size()<SQ && (j<p.size() || k<q.size()); )
                                              ~^~~~~~~~~
bitaro.cpp:42:61: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(j=0, k=0; V[i].size()<SQ && (j<p.size() || k<q.size()); )
                                                            ~^~~~~~~~~
bitaro.cpp:44:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(j<p.size() && (k>=q.size() || p[j].first>q[k].first))
                    ~^~~~~~~~~
bitaro.cpp:44:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(j<p.size() && (k>=q.size() || p[j].first>q[k].first))
                                   ~^~~~~~~~~~
bitaro.cpp:64:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(j=0; j<p.size(); j++) X[p[j].second]=0;
                      ~^~~~~~~~~
bitaro.cpp:65:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(k=0; k<q.size(); k++) X[q[k].second]=0;
                      ~^~~~~~~~~
bitaro.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &N, &M, &Q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &T, &Y);
         ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:80:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &t);
             ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4988 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 9 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 13 ms 6136 KB Output is correct
9 Correct 13 ms 6008 KB Output is correct
10 Correct 14 ms 6004 KB Output is correct
11 Correct 13 ms 6008 KB Output is correct
12 Correct 11 ms 5752 KB Output is correct
13 Correct 12 ms 6028 KB Output is correct
14 Correct 11 ms 5624 KB Output is correct
15 Correct 10 ms 5496 KB Output is correct
16 Correct 11 ms 5624 KB Output is correct
17 Correct 11 ms 5752 KB Output is correct
18 Correct 10 ms 5624 KB Output is correct
19 Correct 12 ms 5880 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4988 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 9 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 13 ms 6136 KB Output is correct
9 Correct 13 ms 6008 KB Output is correct
10 Correct 14 ms 6004 KB Output is correct
11 Correct 13 ms 6008 KB Output is correct
12 Correct 11 ms 5752 KB Output is correct
13 Correct 12 ms 6028 KB Output is correct
14 Correct 11 ms 5624 KB Output is correct
15 Correct 10 ms 5496 KB Output is correct
16 Correct 11 ms 5624 KB Output is correct
17 Correct 11 ms 5752 KB Output is correct
18 Correct 10 ms 5624 KB Output is correct
19 Correct 12 ms 5880 KB Output is correct
20 Correct 532 ms 7216 KB Output is correct
21 Correct 515 ms 7152 KB Output is correct
22 Correct 527 ms 7196 KB Output is correct
23 Correct 539 ms 7072 KB Output is correct
24 Correct 773 ms 87112 KB Output is correct
25 Correct 769 ms 88000 KB Output is correct
26 Correct 766 ms 87792 KB Output is correct
27 Correct 767 ms 111232 KB Output is correct
28 Correct 782 ms 111192 KB Output is correct
29 Correct 774 ms 111032 KB Output is correct
30 Correct 770 ms 111060 KB Output is correct
31 Correct 786 ms 109208 KB Output is correct
32 Correct 767 ms 111044 KB Output is correct
33 Correct 617 ms 73108 KB Output is correct
34 Correct 625 ms 65856 KB Output is correct
35 Correct 616 ms 72680 KB Output is correct
36 Correct 723 ms 91804 KB Output is correct
37 Correct 699 ms 87292 KB Output is correct
38 Correct 742 ms 92036 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4988 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 9 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 13 ms 6136 KB Output is correct
9 Correct 13 ms 6008 KB Output is correct
10 Correct 14 ms 6004 KB Output is correct
11 Correct 13 ms 6008 KB Output is correct
12 Correct 11 ms 5752 KB Output is correct
13 Correct 12 ms 6028 KB Output is correct
14 Correct 11 ms 5624 KB Output is correct
15 Correct 10 ms 5496 KB Output is correct
16 Correct 11 ms 5624 KB Output is correct
17 Correct 11 ms 5752 KB Output is correct
18 Correct 10 ms 5624 KB Output is correct
19 Correct 12 ms 5880 KB Output is correct
20 Correct 532 ms 7216 KB Output is correct
21 Correct 515 ms 7152 KB Output is correct
22 Correct 527 ms 7196 KB Output is correct
23 Correct 539 ms 7072 KB Output is correct
24 Correct 773 ms 87112 KB Output is correct
25 Correct 769 ms 88000 KB Output is correct
26 Correct 766 ms 87792 KB Output is correct
27 Correct 767 ms 111232 KB Output is correct
28 Correct 782 ms 111192 KB Output is correct
29 Correct 774 ms 111032 KB Output is correct
30 Correct 770 ms 111060 KB Output is correct
31 Correct 786 ms 109208 KB Output is correct
32 Correct 767 ms 111044 KB Output is correct
33 Correct 617 ms 73108 KB Output is correct
34 Correct 625 ms 65856 KB Output is correct
35 Correct 616 ms 72680 KB Output is correct
36 Correct 723 ms 91804 KB Output is correct
37 Correct 699 ms 87292 KB Output is correct
38 Correct 742 ms 92036 KB Output is correct
39 Correct 831 ms 86732 KB Output is correct
40 Correct 777 ms 86848 KB Output is correct
41 Correct 1618 ms 87716 KB Output is correct
42 Correct 976 ms 87412 KB Output is correct
43 Correct 783 ms 86964 KB Output is correct
44 Correct 575 ms 7492 KB Output is correct
45 Correct 552 ms 7160 KB Output is correct
46 Correct 690 ms 7212 KB Output is correct
47 Correct 573 ms 7160 KB Output is correct
48 Correct 526 ms 7160 KB Output is correct
49 Correct 816 ms 111224 KB Output is correct
50 Correct 1514 ms 111096 KB Output is correct
51 Correct 561 ms 7696 KB Output is correct
52 Correct 668 ms 7416 KB Output is correct
53 Correct 789 ms 91512 KB Output is correct
54 Correct 818 ms 87200 KB Output is correct
55 Correct 1537 ms 91436 KB Output is correct
56 Correct 1490 ms 87480 KB Output is correct
57 Correct 577 ms 7800 KB Output is correct
58 Correct 581 ms 7800 KB Output is correct
59 Correct 679 ms 7420 KB Output is correct
60 Correct 679 ms 7504 KB Output is correct
61 Correct 939 ms 111020 KB Output is correct
62 Correct 860 ms 91788 KB Output is correct
63 Correct 851 ms 86900 KB Output is correct
64 Correct 1210 ms 111276 KB Output is correct
65 Correct 1177 ms 91732 KB Output is correct
66 Correct 1175 ms 87544 KB Output is correct
67 Correct 1551 ms 111096 KB Output is correct
68 Correct 1416 ms 92044 KB Output is correct
69 Correct 1521 ms 86528 KB Output is correct
70 Correct 800 ms 111096 KB Output is correct
71 Correct 740 ms 91912 KB Output is correct
72 Correct 741 ms 87268 KB Output is correct
73 Correct 812 ms 111280 KB Output is correct
74 Correct 779 ms 91828 KB Output is correct
75 Correct 746 ms 86996 KB Output is correct
76 Correct 915 ms 111228 KB Output is correct
77 Correct 1552 ms 111124 KB Output is correct
78 Correct 778 ms 111472 KB Output is correct
79 Correct 570 ms 7916 KB Output is correct
80 Correct 662 ms 7356 KB Output is correct
81 Correct 524 ms 7584 KB Output is correct
82 Correct 836 ms 111364 KB Output is correct
83 Correct 888 ms 109304 KB Output is correct
84 Correct 1576 ms 110964 KB Output is correct
85 Correct 1546 ms 109096 KB Output is correct
86 Correct 801 ms 111392 KB Output is correct
87 Correct 815 ms 109664 KB Output is correct
88 Correct 575 ms 7800 KB Output is correct
89 Correct 586 ms 7908 KB Output is correct
90 Correct 672 ms 7416 KB Output is correct
91 Correct 685 ms 7544 KB Output is correct
92 Correct 531 ms 7484 KB Output is correct
93 Correct 535 ms 7544 KB Output is correct
94 Correct 684 ms 73080 KB Output is correct
95 Correct 687 ms 65528 KB Output is correct
96 Correct 1178 ms 72884 KB Output is correct
97 Correct 1140 ms 66680 KB Output is correct
98 Correct 652 ms 73300 KB Output is correct
99 Correct 613 ms 66364 KB Output is correct
100 Correct 587 ms 7804 KB Output is correct
101 Correct 588 ms 8076 KB Output is correct
102 Correct 644 ms 7416 KB Output is correct
103 Correct 648 ms 7540 KB Output is correct
104 Correct 541 ms 7388 KB Output is correct
105 Correct 549 ms 7612 KB Output is correct
106 Correct 791 ms 91592 KB Output is correct
107 Correct 821 ms 87288 KB Output is correct
108 Correct 1470 ms 92144 KB Output is correct
109 Correct 1525 ms 87052 KB Output is correct
110 Correct 755 ms 92336 KB Output is correct
111 Correct 729 ms 87592 KB Output is correct
112 Correct 583 ms 7912 KB Output is correct
113 Correct 579 ms 8020 KB Output is correct
114 Correct 665 ms 7544 KB Output is correct
115 Correct 685 ms 7632 KB Output is correct
116 Correct 528 ms 7416 KB Output is correct
117 Correct 536 ms 7480 KB Output is correct
118 Correct 762 ms 110888 KB Output is correct
119 Correct 735 ms 91768 KB Output is correct
120 Correct 711 ms 86720 KB Output is correct
121 Correct 762 ms 110840 KB Output is correct
122 Correct 747 ms 91436 KB Output is correct
123 Correct 708 ms 86776 KB Output is correct
124 Correct 766 ms 111096 KB Output is correct
125 Correct 731 ms 92028 KB Output is correct
126 Correct 706 ms 86648 KB Output is correct