oj.uz

Submission #1008825

# Submission time Handle Problem Language Result Execution time Memory
1008825 2024-06-26T21:38:36 Z Math4Life2020 September (APIO24_september) C++17
100 / 100
 102 ms 14772 KB 
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
using lll = __int128;
const lll p1 = 144403552893599;
const lll a1 = 981372590237;
const lll p2 = 270969106631203;
const lll a2 = 898374183250;

int solve(int N, int M, vector<int> F, vector<vector<int>> S1) {
	vector<vector<int>> S = S1;
	for (ll i=0;i<M;i++) {
		S[i].push_back(0);
	}
	vector<lll> hsh1,hsh2;
	for (ll i=0;i<M;i++) {
		hsh1.push_back(1);
		hsh2.push_back(1);
	}
	vector<ll> stops;
	stops.push_back(0);
	for (ll i=0;i<N;i++) {
		for (ll j=0;j<M;j++) {
			hsh1[j]=(hsh1[j]*(a1+S[j][i]))%p1;
			hsh2[j]=(hsh2[j]*(a2+S[j][i]))%p2;
		}
		bool split = true;
		for (ll j=0;j<M;j++) {
			split = split && (hsh1[j]==hsh1[0]) && (hsh2[j]==hsh2[0]);
		}
		if (split) {
			stops.push_back(i+1);
			for (ll j=0;j<M;j++) {
				hsh1[j]=1;
				hsh2[j]=1;
			}
		}
	}
	//cout << "nstops: "<<stops.size()-1<<"\n";
	ll kv[N];
	ll kind = 0;
	ll delactive[N];
	for (ll i=0;i<N;i++) {
		delactive[i]=0;
		if (stops[kind+1]<=i) {
			kind++;
		}
		kv[S[0][i]]=kind;
	}
	for (ll i=1;i<N;i++) {
		ll x = kv[i]; ll y = kv[F[i]]; //y: parent of x -> if y before x (y<x), then issues
		if (y<x) {
			delactive[y]++;
			delactive[x]--;
			//cout << "+ at "<<y<<", - at "<<x<<"\n";
		}
	}
	ll nact = 0;
	ll ans = 0;
	for (ll i=0;i<(stops.size()-1);i++) {
		nact += delactive[i];
		if (nact == 0) {
			ans++;
		}
	}
	return (ans-1);
}

Compilation message

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:63:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for (ll i=0;i<(stops.size()-1);i++) {
      |              ~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 532 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 532 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 544 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 95 ms 12904 KB Output is correct
5 Correct 100 ms 12908 KB Output is correct
6 Correct 94 ms 12916 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 95 ms 12904 KB Output is correct
19 Correct 100 ms 12908 KB Output is correct
20 Correct 94 ms 12916 KB Output is correct
21 Correct 96 ms 12728 KB Output is correct
22 Correct 94 ms 12640 KB Output is correct
23 Correct 98 ms 12968 KB Output is correct
24 Correct 93 ms 12916 KB Output is correct
25 Correct 102 ms 12644 KB Output is correct
26 Correct 95 ms 12644 KB Output is correct
27 Correct 94 ms 12896 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 532 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 95 ms 12904 KB Output is correct
8 Correct 100 ms 12908 KB Output is correct
9 Correct 94 ms 12916 KB Output is correct
10 Correct 67 ms 14668 KB Output is correct
11 Correct 58 ms 14772 KB Output is correct
12 Correct 60 ms 14688 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 532 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 544 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 95 ms 12904 KB Output is correct
36 Correct 100 ms 12908 KB Output is correct
37 Correct 94 ms 12916 KB Output is correct
38 Correct 96 ms 12728 KB Output is correct
39 Correct 94 ms 12640 KB Output is correct
40 Correct 98 ms 12968 KB Output is correct
41 Correct 93 ms 12916 KB Output is correct
42 Correct 102 ms 12644 KB Output is correct
43 Correct 95 ms 12644 KB Output is correct
44 Correct 94 ms 12896 KB Output is correct
45 Correct 67 ms 14668 KB Output is correct
46 Correct 58 ms 14772 KB Output is correct
47 Correct 60 ms 14688 KB Output is correct
48 Correct 58 ms 13876 KB Output is correct
49 Correct 59 ms 14412 KB Output is correct
50 Correct 59 ms 14008 KB Output is correct
51 Correct 60 ms 14024 KB Output is correct
52 Correct 59 ms 14400 KB Output is correct
53 Correct 58 ms 14724 KB Output is correct
54 Correct 60 ms 14656 KB Output is correct