oj.uz

Submission #443825

# Submission time Handle Problem Language Result Execution time Memory
443825 2021-07-12T07:07:12 Z ComPhyPark Parachute rings (IOI12_rings) C++14
52 / 100
 1243 ms 262148 KB 
#include<cstdio>
#include<vector>
#include<set>
using namespace std;
const int SZ = 1000010;
int min(int a, int b) { return a < b ? a : b; }
int n;
const bool ifDebug = false;
int cycleNum;
typedef struct Graph {
	vector<vector<int>>l;
	int st[4], ts[3];
	int p[SZ], sz[SZ], cs[SZ][4];
	int x;
	void init() {
		x = n;
		l.resize(n);
		st[0] = ts[0] = n;
		st[1] = st[2] = st[3] = st[4] = ts[1] = ts[2] = 0;
		for (int i = 0; i < n; i++) {
			p[i] = i;
			cs[i][0] = sz[i] = 1;
			cs[i][1] = cs[i][2] = cs[i][3] = 0;
		}
	}
	void init(int X, Graph* G) {
		init();
		x = X;
		for (int i = 0; i < n; i++) {
			for (int e : (*G).l[i]) {
				if (e < i)Link(e, i);
			}
		}
	}
	int f(int a) {
		vector<int>v;
		while (a != p[a]) {
			v.push_back(a);
			a = p[a];
		}
		for (int e : v)p[e] = a;
		return a;
	}
	void u(int A, int B) {
		int a = f(A), b = f(B);
		if (a != b) {
			p[b] = a;
			ts[gT(a)]--;
			ts[gT(b)]--;
			for (int i = 0; i < 4; i++) {
				cs[a][i] += cs[b][i];
			}
			sz[a] += sz[b];
		}
		else {
			ts[gT(a)]--;
		}
	}
	void Con(int A, int B) {
		int a = f(A);
		cs[a][min(l[A].size(), 3)]--;
		st[min(l[A].size(), 3)]--;
		l[A].push_back(B);
		cs[a][min(l[A].size(), 3)]++;
		st[min(l[A].size(), 3)]++;
	}
	int gT(int a) {
		if (cs[a][3]) {
			return 2;
		}
		else if (cs[a][2] && (cs[a][1] + cs[a][0] == 0)) {
			return 1;
		}
		else {
			return 0;
		}
	}
	void Link(int A, int B) {
		if (A == x || B == x)return;
		u(A, B);
		Con(A, B);
		Con(B, A);
		int a = f(A);
		ts[gT(a)]++;
	}
	bool isChain() {
		return (ts[1] + ts[2] == 0);
	}
	void PR() {
		if (!ifDebug)return;
		printf("-------%d-------\n", x);
		for (int a = 0; a < n; a++) {
			if (a == p[a]) {
				printf("[%d(%d,%d)]", a, sz[a], gT(a));
				for (int b = 0; b < 4; b++)printf(" %d", cs[a][b]);
				printf("\n");
			}
			else {
				printf("%d->%d\n", a, f(a));
			}
		}
		printf("-----------------\n");
	}
}Graph;
Graph MG, GV[4];
int GS;
//type: 0-chain/1-cycle/2-3 exists/3-4 exists
void Init(int N) {
	cycleNum = n = N;
	MG.init();
}
void Link(int A, int B) {
	bool p = (MG.st[3] == 0);
	MG.Link(A, B);
	for (int i = 0; i < GS; i++) {
		GV[i].Link(A, B);
	}
	if (MG.gT(MG.f(A)) == 1)cycleNum = MG.f(A);
	if (MG.gT(MG.f(B)) == 1)cycleNum = MG.f(B);
	if (p && MG.st[3]) {
		if (ifDebug)printf("걸렸구나!!!!!!!!!\n");
		int a = A;
		if (MG.l[A].size() < 3)a = B;
		GV[GS++].init(a, &MG);
		//return;
		for (int e : MG.l[a]) {
			GV[GS++].init(e, &MG);
		}
	}
}
int CountCritical() {
	if (MG.ts[2]) {
		if (ifDebug)printf(">=3 Exists");
		int r = 0;
		for (int i = 0; i < GS; i++) {
			if (GV[i].isChain())r++;
		}
		return r;
	}
	else if (MG.ts[1]) {
		if (ifDebug)printf("cycle Exists");
		if (MG.ts[1] > 1)return 0;
		return MG.sz[cycleNum];
	}
	else {
		if (ifDebug)printf("Already Chain");
		return n;
	}
}

Compilation message

rings.cpp: In function 'void Init(int)':
rings.cpp:19:31: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
   19 |   st[1] = st[2] = st[3] = st[4] = ts[1] = ts[2] = 0;
      |                           ~~~~^
rings.cpp:12:6: note: while referencing 'Graph::st'
   12 |  int st[4], ts[3];
      |      ^~
rings.cpp:105:7: note: defined here 'MG'
  105 | Graph MG, GV[4];
      |       ^~
rings.cpp: In member function 'void Graph::init(int, Graph*)':
rings.cpp:19:31: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
   19 |   st[1] = st[2] = st[3] = st[4] = ts[1] = ts[2] = 0;
      |                           ~~~~^
rings.cpp:12:6: note: while referencing 'Graph::st'
   12 |  int st[4], ts[3];
      |      ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 9 ms 1996 KB Output is correct
3 Correct 11 ms 2388 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 2 ms 1612 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 12 ms 2300 KB Output is correct
10 Correct 12 ms 2396 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 41104 KB Output is correct
2 Runtime error 1243 ms 262148 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 9 ms 1996 KB Output is correct
3 Correct 11 ms 2388 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 2 ms 1612 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 12 ms 2300 KB Output is correct
10 Correct 12 ms 2396 KB Output is correct
11 Correct 14 ms 2348 KB Output is correct
12 Correct 20 ms 4300 KB Output is correct
13 Correct 26 ms 4196 KB Output is correct
14 Correct 18 ms 3588 KB Output is correct
15 Correct 26 ms 5708 KB Output is correct
16 Correct 6 ms 1180 KB Output is correct
17 Correct 21 ms 4292 KB Output is correct
18 Correct 26 ms 7116 KB Output is correct
19 Correct 9 ms 1100 KB Output is correct
20 Correct 23 ms 4300 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 9 ms 1996 KB Output is correct
3 Correct 11 ms 2388 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 2 ms 1612 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 12 ms 2300 KB Output is correct
10 Correct 12 ms 2396 KB Output is correct
11 Correct 14 ms 2348 KB Output is correct
12 Correct 20 ms 4300 KB Output is correct
13 Correct 26 ms 4196 KB Output is correct
14 Correct 18 ms 3588 KB Output is correct
15 Correct 26 ms 5708 KB Output is correct
16 Correct 6 ms 1180 KB Output is correct
17 Correct 21 ms 4292 KB Output is correct
18 Correct 26 ms 7116 KB Output is correct
19 Correct 9 ms 1100 KB Output is correct
20 Correct 23 ms 4300 KB Output is correct
21 Correct 25 ms 3660 KB Output is correct
22 Correct 45 ms 5664 KB Output is correct
23 Correct 55 ms 7124 KB Output is correct
24 Correct 317 ms 29304 KB Output is correct
25 Correct 58 ms 24516 KB Output is correct
26 Correct 236 ms 32960 KB Output is correct
27 Correct 85 ms 6964 KB Output is correct
28 Correct 333 ms 34892 KB Output is correct
29 Correct 155 ms 31140 KB Output is correct
30 Correct 83 ms 8004 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 9 ms 1996 KB Output is correct
3 Correct 11 ms 2388 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 2 ms 1612 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 12 ms 2300 KB Output is correct
10 Correct 12 ms 2396 KB Output is correct
11 Correct 554 ms 41104 KB Output is correct
12 Runtime error 1243 ms 262148 KB Execution killed with signal 9
13 Halted 0 ms 0 KB -