oj.uz

Submission #203050

# Submission time Handle Problem Language Result Execution time Memory
203050 2020-02-19T05:18:18 Z Rakhmand Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1278 ms 146040 KB 
//
//  ROIGold.cpp
//  Main calisma
//
//  Created by Rakhman on 05/02/2019.
//  Copyright © 2019 Rakhman. All rights reserved.
//

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>

#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)

const int MXN = 1e5 + 1;
const long long MNN = 1e6 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;

typedef long long llong;
typedef unsigned long long ullong;

using namespace std;

void istxt(bool yes){
    if(yes == 1){
        freopen("balancing.in", "r", stdin);
        //freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/e.txt", "w", stdout);
    }else{
        freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin);
    }
}

int n, q, m, dp[MXN], lol[MXN], sq = 100;
vector<int> g[MXN];
vector<pair<int, int> > best[MXN], ans[MXN];
bool visit[MXN];

int main () {
    ios;
    //istxt(0);
    cin >> n >> m >> q;
    for(int i = 1; i <= m; i++){
        int u, v;
        cin >> u >> v;
        g[v].pb(u);
    }
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < g[i].size(); j++){
            int last = g[i][j];
            for(int e = 0; e < ans[last].size(); e++){
                int cost = ans[last][e].F, pos = ans[last][e].S;
                lol[pos] = max(lol[pos], cost + 1);
            }
        }
        for(int j = 0; j < g[i].size(); j++){
            int last = g[i][j];
            for(int e = 0; e < ans[last].size(); e++){
                int pos = ans[last][e].S;
                if(lol[pos] != -1){
                    ans[i].push_back({lol[pos], pos});
                    lol[pos] = -1;
                }
            }
        }
        ans[i].push_back({0, i});
        sort(ans[i].begin(), ans[i].end(), greater<pair<int, int> >());
        while(ans[i].size() > sq){
            ans[i].pop_back();
        }
    }
    while(q--){
        int x, k;
        cin >> x >> k;
        vector<int> keks;
        for(int i = 0; i < k; i++){
            int u;
            cin >> u;
            keks.push_back(u);
            visit[u] = 1;
        }
        if(k >= sq){
            for(int i = x; i >= 1; i--){
                dp[i] = -OO;
            }
            dp[x] = 0;
            int res = -1;
            for(int i = x; i >= 1; i--){
                if(dp[i] < 0) continue;
                if(dp[i] > res && visit[i] == 0) res = dp[i];
                for(int j = 0; j < g[i].size(); j++) dp[g[i][j]] = max(dp[g[i][j]], dp[i] + 1);
            }
            cout << res << nl;
        }else{
            int res = -1;
            for(int i = 0; i < ans[x].size(); i++){
                if(visit[ans[x][i].S] == 0){
                    res = ans[x][i].F;
                    break;
                }
            }
            cout << res << nl;
        }
        for(int i = 0; i < keks.size(); i++){
            visit[keks[i]] = 0;
        }
    }
    return 0;
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:77:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < g[i].size(); j++){
                        ~~^~~~~~~~~~~~~
bitaro.cpp:79:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int e = 0; e < ans[last].size(); e++){
                            ~~^~~~~~~~~~~~~~~~~~
bitaro.cpp:84:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < g[i].size(); j++){
                        ~~^~~~~~~~~~~~~
bitaro.cpp:86:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int e = 0; e < ans[last].size(); e++){
                            ~~^~~~~~~~~~~~~~~~~~
bitaro.cpp:96:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(ans[i].size() > sq){
               ~~~~~~~~~~~~~~^~~~
bitaro.cpp:119:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int j = 0; j < g[i].size(); j++) dp[g[i][j]] = max(dp[g[i][j]], dp[i] + 1);
                                ~~^~~~~~~~~~~~~
bitaro.cpp:124:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < ans[x].size(); i++){
                            ~~^~~~~~~~~~~~~~~
bitaro.cpp:132:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < keks.size(); i++){
                        ~~^~~~~~~~~~~~~
bitaro.cpp: In function 'void istxt(bool)':
bitaro.cpp:55:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("balancing.in", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 14 ms 7928 KB Output is correct
6 Correct 13 ms 7928 KB Output is correct
7 Correct 14 ms 7800 KB Output is correct
8 Correct 15 ms 8440 KB Output is correct
9 Correct 14 ms 8440 KB Output is correct
10 Correct 14 ms 8440 KB Output is correct
11 Correct 14 ms 8312 KB Output is correct
12 Correct 14 ms 8184 KB Output is correct
13 Correct 16 ms 8316 KB Output is correct
14 Correct 13 ms 8056 KB Output is correct
15 Correct 13 ms 7928 KB Output is correct
16 Correct 14 ms 8056 KB Output is correct
17 Correct 14 ms 8184 KB Output is correct
18 Correct 13 ms 8056 KB Output is correct
19 Correct 14 ms 8184 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 14 ms 7928 KB Output is correct
6 Correct 13 ms 7928 KB Output is correct
7 Correct 14 ms 7800 KB Output is correct
8 Correct 15 ms 8440 KB Output is correct
9 Correct 14 ms 8440 KB Output is correct
10 Correct 14 ms 8440 KB Output is correct
11 Correct 14 ms 8312 KB Output is correct
12 Correct 14 ms 8184 KB Output is correct
13 Correct 16 ms 8316 KB Output is correct
14 Correct 13 ms 8056 KB Output is correct
15 Correct 13 ms 7928 KB Output is correct
16 Correct 14 ms 8056 KB Output is correct
17 Correct 14 ms 8184 KB Output is correct
18 Correct 13 ms 8056 KB Output is correct
19 Correct 14 ms 8184 KB Output is correct
20 Correct 148 ms 9848 KB Output is correct
21 Correct 136 ms 9848 KB Output is correct
22 Correct 140 ms 9848 KB Output is correct
23 Correct 149 ms 9884 KB Output is correct
24 Correct 786 ms 115960 KB Output is correct
25 Correct 775 ms 112496 KB Output is correct
26 Correct 768 ms 111964 KB Output is correct
27 Correct 554 ms 113908 KB Output is correct
28 Correct 554 ms 113780 KB Output is correct
29 Correct 554 ms 113776 KB Output is correct
30 Correct 574 ms 113472 KB Output is correct
31 Correct 713 ms 131572 KB Output is correct
32 Correct 568 ms 113528 KB Output is correct
33 Correct 474 ms 77944 KB Output is correct
34 Correct 678 ms 105720 KB Output is correct
35 Correct 471 ms 77560 KB Output is correct
36 Correct 530 ms 94836 KB Output is correct
37 Correct 744 ms 116480 KB Output is correct
38 Correct 523 ms 94712 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 14 ms 7928 KB Output is correct
6 Correct 13 ms 7928 KB Output is correct
7 Correct 14 ms 7800 KB Output is correct
8 Correct 15 ms 8440 KB Output is correct
9 Correct 14 ms 8440 KB Output is correct
10 Correct 14 ms 8440 KB Output is correct
11 Correct 14 ms 8312 KB Output is correct
12 Correct 14 ms 8184 KB Output is correct
13 Correct 16 ms 8316 KB Output is correct
14 Correct 13 ms 8056 KB Output is correct
15 Correct 13 ms 7928 KB Output is correct
16 Correct 14 ms 8056 KB Output is correct
17 Correct 14 ms 8184 KB Output is correct
18 Correct 13 ms 8056 KB Output is correct
19 Correct 14 ms 8184 KB Output is correct
20 Correct 148 ms 9848 KB Output is correct
21 Correct 136 ms 9848 KB Output is correct
22 Correct 140 ms 9848 KB Output is correct
23 Correct 149 ms 9884 KB Output is correct
24 Correct 786 ms 115960 KB Output is correct
25 Correct 775 ms 112496 KB Output is correct
26 Correct 768 ms 111964 KB Output is correct
27 Correct 554 ms 113908 KB Output is correct
28 Correct 554 ms 113780 KB Output is correct
29 Correct 554 ms 113776 KB Output is correct
30 Correct 574 ms 113472 KB Output is correct
31 Correct 713 ms 131572 KB Output is correct
32 Correct 568 ms 113528 KB Output is correct
33 Correct 474 ms 77944 KB Output is correct
34 Correct 678 ms 105720 KB Output is correct
35 Correct 471 ms 77560 KB Output is correct
36 Correct 530 ms 94836 KB Output is correct
37 Correct 744 ms 116480 KB Output is correct
38 Correct 523 ms 94712 KB Output is correct
39 Correct 875 ms 117476 KB Output is correct
40 Correct 813 ms 113376 KB Output is correct
41 Correct 824 ms 115064 KB Output is correct
42 Correct 813 ms 114296 KB Output is correct
43 Correct 814 ms 116088 KB Output is correct
44 Correct 176 ms 10616 KB Output is correct
45 Correct 154 ms 10104 KB Output is correct
46 Correct 311 ms 10360 KB Output is correct
47 Correct 176 ms 10232 KB Output is correct
48 Correct 138 ms 10104 KB Output is correct
49 Correct 647 ms 113528 KB Output is correct
50 Correct 1215 ms 113400 KB Output is correct
51 Correct 179 ms 10492 KB Output is correct
52 Correct 315 ms 10248 KB Output is correct
53 Correct 600 ms 94328 KB Output is correct
54 Correct 807 ms 115436 KB Output is correct
55 Correct 958 ms 94328 KB Output is correct
56 Correct 988 ms 119288 KB Output is correct
57 Correct 173 ms 10616 KB Output is correct
58 Correct 177 ms 10616 KB Output is correct
59 Correct 321 ms 10104 KB Output is correct
60 Correct 312 ms 10232 KB Output is correct
61 Correct 756 ms 113272 KB Output is correct
62 Correct 668 ms 94448 KB Output is correct
63 Correct 849 ms 114408 KB Output is correct
64 Correct 1098 ms 113068 KB Output is correct
65 Correct 854 ms 94072 KB Output is correct
66 Correct 889 ms 116216 KB Output is correct
67 Correct 1253 ms 113048 KB Output is correct
68 Correct 982 ms 94416 KB Output is correct
69 Correct 990 ms 116216 KB Output is correct
70 Correct 645 ms 113140 KB Output is correct
71 Correct 580 ms 94204 KB Output is correct
72 Correct 786 ms 116120 KB Output is correct
73 Correct 650 ms 113172 KB Output is correct
74 Correct 589 ms 94328 KB Output is correct
75 Correct 785 ms 118496 KB Output is correct
76 Correct 673 ms 113400 KB Output is correct
77 Correct 1278 ms 113276 KB Output is correct
78 Correct 618 ms 114084 KB Output is correct
79 Correct 176 ms 11000 KB Output is correct
80 Correct 304 ms 10616 KB Output is correct
81 Correct 146 ms 10616 KB Output is correct
82 Correct 681 ms 114104 KB Output is correct
83 Correct 869 ms 135288 KB Output is correct
84 Correct 1130 ms 113592 KB Output is correct
85 Correct 1150 ms 146040 KB Output is correct
86 Correct 595 ms 113476 KB Output is correct
87 Correct 776 ms 134700 KB Output is correct
88 Correct 183 ms 10360 KB Output is correct
89 Correct 178 ms 10488 KB Output is correct
90 Correct 317 ms 10104 KB Output is correct
91 Correct 316 ms 10104 KB Output is correct
92 Correct 162 ms 9976 KB Output is correct
93 Correct 146 ms 10108 KB Output is correct
94 Correct 558 ms 78200 KB Output is correct
95 Correct 835 ms 111920 KB Output is correct
96 Correct 839 ms 77880 KB Output is correct
97 Correct 1004 ms 112804 KB Output is correct
98 Correct 489 ms 78184 KB Output is correct
99 Correct 726 ms 108932 KB Output is correct
100 Correct 183 ms 10360 KB Output is correct
101 Correct 186 ms 10488 KB Output is correct
102 Correct 269 ms 10104 KB Output is correct
103 Correct 262 ms 10104 KB Output is correct
104 Correct 147 ms 10080 KB Output is correct
105 Correct 149 ms 10104 KB Output is correct
106 Correct 646 ms 94304 KB Output is correct
107 Correct 858 ms 120560 KB Output is correct
108 Correct 990 ms 94744 KB Output is correct
109 Correct 1002 ms 112308 KB Output is correct
110 Correct 564 ms 95008 KB Output is correct
111 Correct 764 ms 117748 KB Output is correct
112 Correct 180 ms 10488 KB Output is correct
113 Correct 181 ms 10488 KB Output is correct
114 Correct 301 ms 10212 KB Output is correct
115 Correct 281 ms 10076 KB Output is correct
116 Correct 140 ms 10104 KB Output is correct
117 Correct 144 ms 9976 KB Output is correct
118 Correct 602 ms 112816 KB Output is correct
119 Correct 575 ms 94328 KB Output is correct
120 Correct 804 ms 121648 KB Output is correct
121 Correct 602 ms 112992 KB Output is correct
122 Correct 578 ms 93944 KB Output is correct
123 Correct 819 ms 120836 KB Output is correct
124 Correct 608 ms 112916 KB Output is correct
125 Correct 572 ms 94552 KB Output is correct
126 Correct 793 ms 117604 KB Output is correct