oj.uz

Submission #991530

# Submission time Handle Problem Language Result Execution time Memory
991530 2024-06-02T11:32:08 Z Nika533 September (APIO24_september) C++17
75 / 100
 1000 ms 24520 KB 
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;

const int N=1e5+5,M=15;
int T,k,sz[N][M],p[N][M];
vector<int> g[N];

void make_set(int v, int t) {
	p[v][t]=v; sz[v][t]=1;
}
int find_set(int v, int t) {
	if (p[v][t]==v) return v;
	return p[v][t]=find_set(p[v][t],t);
}
void merge(int a, int b, int t) {
	a=find_set(a,t); b=find_set(b,t);
	if (a==b) return;
	if (sz[a][t]<sz[b][t]) swap(a,b);
	sz[a][t]+=sz[b][t]; p[b][t]=a;
}

void add_edges(int v, int t) {
	for (auto u:g[v]) if (p[u][t]>=0) merge(u,v,t);
}

int solve(int n, int m, vector<int> F,vector<vector<int>> S) {
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) p[i][j]=-1;
		g[i].clear();
	}
	for (int i=1; i<n; i++) {
		g[i].pb(F[i]); g[F[i]].pb(i);
	}
	int ans=0;
	for (int i=0; i<m; i++) make_set(0,i);
	set<int> myset[m];
	for (int i=n-2; i>=0; i--) {
		bool check=1;
		for (int j=0; j<m; j++) {
			int x=S[j][i];
			myset[j].insert(x);
			make_set(x,j);
			add_edges(x,j);
			if (sz[find_set(x,j)][j]!=n-i) check=0;
		}
		for (int j=1; j<m; j++) {
			if (myset[j]!=myset[j-1]) check=0;
		}
		if (check) ans++;
	}
	return ans;
}

Compilation message

september.cpp:1:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
    1 | #pragma GCC diagnostic warning "-std=c++11"
      |                                ^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 16 ms 7004 KB Output is correct
5 Correct 17 ms 7004 KB Output is correct
6 Correct 15 ms 7096 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 16 ms 7004 KB Output is correct
26 Correct 17 ms 7004 KB Output is correct
27 Correct 15 ms 7096 KB Output is correct
28 Correct 14 ms 7000 KB Output is correct
29 Correct 15 ms 6996 KB Output is correct
30 Correct 15 ms 7000 KB Output is correct
31 Correct 13 ms 7000 KB Output is correct
32 Correct 16 ms 7004 KB Output is correct
33 Correct 16 ms 7004 KB Output is correct
34 Correct 15 ms 7076 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 184 ms 23716 KB Output is correct
5 Correct 185 ms 23752 KB Output is correct
6 Correct 190 ms 23980 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 184 ms 23716 KB Output is correct
19 Correct 185 ms 23752 KB Output is correct
20 Correct 190 ms 23980 KB Output is correct
21 Correct 320 ms 24444 KB Output is correct
22 Correct 310 ms 24488 KB Output is correct
23 Correct 306 ms 24412 KB Output is correct
24 Correct 286 ms 24232 KB Output is correct
25 Correct 317 ms 24520 KB Output is correct
26 Correct 314 ms 24328 KB Output is correct
27 Correct 279 ms 24236 KB Output is correct

Subtask #9
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 16 ms 7004 KB Output is correct
5 Correct 17 ms 7004 KB Output is correct
6 Correct 15 ms 7096 KB Output is correct
7 Correct 184 ms 23716 KB Output is correct
8 Correct 185 ms 23752 KB Output is correct
9 Correct 190 ms 23980 KB Output is correct
10 Execution timed out 1055 ms 10276 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #10
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 16 ms 7004 KB Output is correct
26 Correct 17 ms 7004 KB Output is correct
27 Correct 15 ms 7096 KB Output is correct
28 Correct 14 ms 7000 KB Output is correct
29 Correct 15 ms 6996 KB Output is correct
30 Correct 15 ms 7000 KB Output is correct
31 Correct 13 ms 7000 KB Output is correct
32 Correct 16 ms 7004 KB Output is correct
33 Correct 16 ms 7004 KB Output is correct
34 Correct 15 ms 7076 KB Output is correct
35 Correct 184 ms 23716 KB Output is correct
36 Correct 185 ms 23752 KB Output is correct
37 Correct 190 ms 23980 KB Output is correct
38 Correct 320 ms 24444 KB Output is correct
39 Correct 310 ms 24488 KB Output is correct
40 Correct 306 ms 24412 KB Output is correct
41 Correct 286 ms 24232 KB Output is correct
42 Correct 317 ms 24520 KB Output is correct
43 Correct 314 ms 24328 KB Output is correct
44 Correct 279 ms 24236 KB Output is correct
45 Execution timed out 1055 ms 10276 KB Time limit exceeded
46 Halted 0 ms 0 KB -