oj.uz

답안 #722106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722106 2023-04-11T12:16:49 Z NothingXD Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1076 ms 114328 KB 
/*

   Wei Wai Wei Wai
   Zumigat nan damu dimi kwayt rayt

*/

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;
/*typedef __uint128_t L;
  struct FastMod {
  ull b, m;
  FastMod(ull b) : b(b), m(ull((L(1) << 64) / b)) {}
  ull reduce(ull a) {
  ull q = (ull)((L(m) * a) >> 64);
  ull r = a - q * b; // can be proven that 0 <= r < 2*b
  return r >= b ? r - b : r;
  }
  };
  FastMod FM(2);
  */
void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	cerr << " " << H;
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
#define F first
#define S second

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 1e5 + 10;
const int sq = 100;
const int inf = 1e9;

int n, m, q, a[maxn], dp[maxn];
vector<int> g[maxn];
vector<pii> val[maxn];
bool mark[maxn];

vector<pii> merge(vector<pii> a, vector<pii> b){
	vector<pii> res;
	int pta = 0, ptb = 0;
	while(pta < a.size() || ptb < b.size()){
		if (ptb == b.size() || (pta < a.size() && a[pta] > b[ptb])){
			res.push_back(a[pta]);
			pta++;
		}
		else{
			res.push_back(b[ptb]);
			ptb++;
		}
	}
	return res;
}

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

	cin >> n >> m >> q;
	for (int i = 1; i <= m; i++){
		int u, v; cin >> u >> v;
		g[v].push_back(u);
	}

	for (int i = 1; i <= n; i++){
		val[i].push_back({-1, i});
		for (int j = sq; val[i].size() < sq; j--) if (j != i) val[i].push_back({-inf, j});
		for (auto u: g[i]){
			vector<pii> tmp = merge(val[i], val[u]);
			val[i].clear();
			for (auto x: tmp){
				if (val[i].size() == sq) break;
				if (!mark[x.S]) val[i].push_back(x);
				mark[x.S] = true;
			}
			for (auto x: val[i]) mark[x.S] = false;
		}
		for (int j = 0; j < sq; j++){
			val[i][j].F++;
		}
	}

	while(q--){
		int v, k; cin >> v >> k;
		for (int i = 1; i <= k; i++){
			cin >> a[i];
			mark[a[i]] = true;
		}
		if (k < sq){
			for (auto [x, y]: val[v]){
				if (!mark[y]){
					cout << (x < 0? -1: x) << '\n';
					break;
				}
			}
		}
		else{
			for (int i = 1; i <= v; i++){
				dp[i] = (mark[i]? -inf: 0);
				for (auto u: g[i]){
					dp[i] = max(dp[i], dp[u] + 1);
				}
			}
			cout << (dp[v] < 0? -1: dp[v]) << '\n';
		}
		for (int i = 1; i <= k; i++) mark[a[i]] = false;
	}

	return 0;
}

Compilation message

bitaro.cpp: In function 'std::vector<std::pair<int, int> > merge(std::vector<std::pair<int, int> >, std::vector<std::pair<int, int> >)':
bitaro.cpp:57:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  while(pta < a.size() || ptb < b.size()){
      |        ~~~~^~~~~~~~~~
bitaro.cpp:57:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  while(pta < a.size() || ptb < b.size()){
      |                          ~~~~^~~~~~~~~~
bitaro.cpp:58:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   if (ptb == b.size() || (pta < a.size() && a[pta] > b[ptb])){
      |       ~~~~^~~~~~~~~~~
bitaro.cpp:58:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   if (ptb == b.size() || (pta < a.size() && a[pta] > b[ptb])){
      |                           ~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 10 ms 6100 KB Output is correct
6 Correct 11 ms 5988 KB Output is correct
7 Correct 10 ms 5972 KB Output is correct
8 Correct 11 ms 6040 KB Output is correct
9 Correct 9 ms 6036 KB Output is correct
10 Correct 9 ms 5972 KB Output is correct
11 Correct 10 ms 5972 KB Output is correct
12 Correct 10 ms 5972 KB Output is correct
13 Correct 9 ms 6044 KB Output is correct
14 Correct 10 ms 5980 KB Output is correct
15 Correct 10 ms 6052 KB Output is correct
16 Correct 9 ms 6060 KB Output is correct
17 Correct 12 ms 5972 KB Output is correct
18 Correct 9 ms 6020 KB Output is correct
19 Correct 10 ms 6016 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 10 ms 6100 KB Output is correct
6 Correct 11 ms 5988 KB Output is correct
7 Correct 10 ms 5972 KB Output is correct
8 Correct 11 ms 6040 KB Output is correct
9 Correct 9 ms 6036 KB Output is correct
10 Correct 9 ms 5972 KB Output is correct
11 Correct 10 ms 5972 KB Output is correct
12 Correct 10 ms 5972 KB Output is correct
13 Correct 9 ms 6044 KB Output is correct
14 Correct 10 ms 5980 KB Output is correct
15 Correct 10 ms 6052 KB Output is correct
16 Correct 9 ms 6060 KB Output is correct
17 Correct 12 ms 5972 KB Output is correct
18 Correct 9 ms 6020 KB Output is correct
19 Correct 10 ms 6016 KB Output is correct
20 Correct 447 ms 7168 KB Output is correct
21 Correct 448 ms 7216 KB Output is correct
22 Correct 451 ms 7172 KB Output is correct
23 Correct 437 ms 7164 KB Output is correct
24 Correct 696 ms 110028 KB Output is correct
25 Correct 721 ms 110272 KB Output is correct
26 Correct 723 ms 110140 KB Output is correct
27 Correct 633 ms 110532 KB Output is correct
28 Correct 627 ms 110580 KB Output is correct
29 Correct 656 ms 110792 KB Output is correct
30 Correct 660 ms 110412 KB Output is correct
31 Correct 692 ms 110740 KB Output is correct
32 Correct 654 ms 110392 KB Output is correct
33 Correct 618 ms 110008 KB Output is correct
34 Correct 637 ms 110284 KB Output is correct
35 Correct 628 ms 110032 KB Output is correct
36 Correct 619 ms 110304 KB Output is correct
37 Correct 634 ms 109996 KB Output is correct
38 Correct 628 ms 110112 KB Output is correct

Subtask #3
86.0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 10 ms 6100 KB Output is correct
6 Correct 11 ms 5988 KB Output is correct
7 Correct 10 ms 5972 KB Output is correct
8 Correct 11 ms 6040 KB Output is correct
9 Correct 9 ms 6036 KB Output is correct
10 Correct 9 ms 5972 KB Output is correct
11 Correct 10 ms 5972 KB Output is correct
12 Correct 10 ms 5972 KB Output is correct
13 Correct 9 ms 6044 KB Output is correct
14 Correct 10 ms 5980 KB Output is correct
15 Correct 10 ms 6052 KB Output is correct
16 Correct 9 ms 6060 KB Output is correct
17 Correct 12 ms 5972 KB Output is correct
18 Correct 9 ms 6020 KB Output is correct
19 Correct 10 ms 6016 KB Output is correct
20 Correct 447 ms 7168 KB Output is correct
21 Correct 448 ms 7216 KB Output is correct
22 Correct 451 ms 7172 KB Output is correct
23 Correct 437 ms 7164 KB Output is correct
24 Correct 696 ms 110028 KB Output is correct
25 Correct 721 ms 110272 KB Output is correct
26 Correct 723 ms 110140 KB Output is correct
27 Correct 633 ms 110532 KB Output is correct
28 Correct 627 ms 110580 KB Output is correct
29 Correct 656 ms 110792 KB Output is correct
30 Correct 660 ms 110412 KB Output is correct
31 Correct 692 ms 110740 KB Output is correct
32 Correct 654 ms 110392 KB Output is correct
33 Correct 618 ms 110008 KB Output is correct
34 Correct 637 ms 110284 KB Output is correct
35 Correct 628 ms 110032 KB Output is correct
36 Correct 619 ms 110304 KB Output is correct
37 Correct 634 ms 109996 KB Output is correct
38 Correct 628 ms 110112 KB Output is correct
39 Correct 753 ms 111320 KB Output is correct
40 Correct 712 ms 112576 KB Output is correct
41 Correct 985 ms 112868 KB Output is correct
42 Correct 764 ms 112844 KB Output is correct
43 Correct 726 ms 112956 KB Output is correct
44 Correct 475 ms 10028 KB Output is correct
45 Correct 456 ms 9288 KB Output is correct
46 Correct 513 ms 9252 KB Output is correct
47 Correct 466 ms 8868 KB Output is correct
48 Correct 452 ms 8736 KB Output is correct
49 Correct 673 ms 113828 KB Output is correct
50 Correct 885 ms 113000 KB Output is correct
51 Correct 458 ms 9932 KB Output is correct
52 Correct 517 ms 9016 KB Output is correct
53 Correct 681 ms 113484 KB Output is correct
54 Correct 682 ms 113136 KB Output is correct
55 Correct 951 ms 112704 KB Output is correct
56 Correct 941 ms 112648 KB Output is correct
57 Correct 467 ms 9852 KB Output is correct
58 Correct 480 ms 9808 KB Output is correct
59 Correct 505 ms 8928 KB Output is correct
60 Correct 501 ms 8952 KB Output is correct
61 Correct 668 ms 113076 KB Output is correct
62 Correct 671 ms 112624 KB Output is correct
63 Correct 705 ms 113016 KB Output is correct
64 Correct 774 ms 113200 KB Output is correct
65 Correct 808 ms 112636 KB Output is correct
66 Correct 822 ms 112816 KB Output is correct
67 Correct 875 ms 112988 KB Output is correct
68 Correct 922 ms 112680 KB Output is correct
69 Correct 1006 ms 112780 KB Output is correct
70 Correct 668 ms 113064 KB Output is correct
71 Correct 661 ms 112752 KB Output is correct
72 Correct 701 ms 112792 KB Output is correct
73 Correct 721 ms 113036 KB Output is correct
74 Correct 808 ms 112756 KB Output is correct
75 Correct 800 ms 112732 KB Output is correct
76 Correct 739 ms 114328 KB Output is correct
77 Correct 973 ms 113316 KB Output is correct
78 Correct 689 ms 113372 KB Output is correct
79 Correct 530 ms 9996 KB Output is correct
80 Correct 558 ms 9076 KB Output is correct
81 Correct 483 ms 8772 KB Output is correct
82 Correct 764 ms 114168 KB Output is correct
83 Correct 752 ms 113976 KB Output is correct
84 Correct 905 ms 113348 KB Output is correct
85 Correct 879 ms 113400 KB Output is correct
86 Correct 627 ms 113268 KB Output is correct
87 Correct 679 ms 113236 KB Output is correct
88 Correct 482 ms 10024 KB Output is correct
89 Correct 499 ms 10008 KB Output is correct
90 Correct 559 ms 9088 KB Output is correct
91 Correct 549 ms 9052 KB Output is correct
92 Correct 465 ms 8628 KB Output is correct
93 Correct 476 ms 8756 KB Output is correct
94 Correct 723 ms 113572 KB Output is correct
95 Correct 681 ms 113508 KB Output is correct
96 Correct 869 ms 112904 KB Output is correct
97 Correct 930 ms 112880 KB Output is correct
98 Correct 643 ms 112916 KB Output is correct
99 Correct 661 ms 112748 KB Output is correct
100 Correct 485 ms 10128 KB Output is correct
101 Correct 469 ms 10008 KB Output is correct
102 Correct 505 ms 9132 KB Output is correct
103 Correct 488 ms 9264 KB Output is correct
104 Correct 445 ms 8780 KB Output is correct
105 Correct 445 ms 8832 KB Output is correct
106 Correct 673 ms 113632 KB Output is correct
107 Correct 690 ms 113880 KB Output is correct
108 Correct 985 ms 112936 KB Output is correct
109 Correct 1076 ms 112848 KB Output is correct
110 Correct 672 ms 112936 KB Output is correct
111 Correct 748 ms 112880 KB Output is correct
112 Correct 541 ms 10016 KB Output is correct
113 Correct 661 ms 9968 KB Output is correct
114 Correct 583 ms 9168 KB Output is correct
115 Correct 619 ms 9056 KB Output is correct
116 Correct 510 ms 8652 KB Output is correct
117 Correct 517 ms 8748 KB Output is correct
118 Correct 757 ms 112548 KB Output is correct
119 Correct 734 ms 112212 KB Output is correct
120 Correct 757 ms 112124 KB Output is correct
121 Correct 743 ms 112580 KB Output is correct
122 Correct 666 ms 112360 KB Output is correct
123 Correct 689 ms 112216 KB Output is correct
124 Correct 671 ms 112600 KB Output is correct
125 Correct 662 ms 112240 KB Output is correct
126 Correct 660 ms 112204 KB Output is correct