oj.uz

답안 #628390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628390 2022-08-13T11:17:38 Z haojiandan 수천개의 섬 (IOI22_islands) C++17
100 / 100
 121 ms 20108 KB 
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
const int maxn=(1e5)+10;
int n,m; vector<int> bk[maxn];
int out[maxn],q[maxn],hd,tl;
bool del[maxn];
vector<int> ans,vec,res;
vector<pair<int,int> > g[maxn];
int to[maxn];
int d[maxn],t1,e[maxn],t2;
int pos[maxn],vis[maxn],To[maxn];
int D[maxn],E[maxn];
int at[maxn*2];

variant<bool,vector<int> > find_journey(int _n,int _m,vector<int> U,vector<int> V) {
   	n=_n,m=_m;
   	for (int i=0;i<m;i++) bk[V[i]].push_back(U[i]),g[U[i]].push_back(MP(V[i],i)),out[U[i]]++;
   	int x=0;
   	for (int i=0;i<n;i++) if (!out[i]) q[++tl]=i,del[i]=1; hd=1;
   	while (hd<=tl||out[x]==1) {
	   	while (hd<=tl) {
	   		int x=q[hd]; hd++;
	   		for (int &y : bk[x]) { out[y]--; if (!out[y]) q[++tl]=y,del[y]=1; }
	   	}
	   	while (out[x]==1) {
	   		del[x]=1;
	   		for (int &y : bk[x]) { out[y]--; if (!out[y]&&!del[y]) q[++tl]=y,del[y]=1; }
	   		bool fd=0;
	   		for (auto [y,id] : g[x]) if (!del[y]) { fd=1; vec.push_back(id); x=y; break; }
	   	//	printf("x=%d\n",x);
	   		if (!fd) return false;
	   	}
	  // 	printf("x=%d\n",x);
	}
	if (out[x]<2) return false;
   	for (int i=0;i<n;i++) if (!del[i]) {
   		for (auto [j,id] : g[i]) if (!del[j]) to[i]=j,To[i]=id;
   	}
   	int a=-1,b=-1;
   	for (auto [y,id] : g[x]) if (!del[y]) {
   		if (a==-1) a=y,D[1]=id; else b=y,E[1]=id;
   	}
  // 	cerr<<x<<" "<<a<<" "<<b<<endl;
	int l,r;
	int y=a; vis[x]=1; d[t1=1]=x;
	while (!vis[y]) vis[y]=1,d[++t1]=y,D[t1]=To[y],y=to[y];
	for (int i=1;i<=t1;i++) if (y==d[i]) l=i;
	memset(vis,0,sizeof(vis));
	y=b; vis[x]=1; e[t2=1]=x;
	while (!vis[y]) vis[y]=1,e[++t2]=y,E[t2]=To[y],y=to[y];
	for (int i=1;i<=t2;i++) if (y==e[i]) r=i;
	
	for (int i=1;i<=t1;i++) pos[d[i]]=i;
	int fd=0;
	for (int i=2;i<=t2;i++) if (pos[e[i]]) { fd=i; break; }
	//printf("fd=%d\n",fd);
	//for (int i=1;i<=t1;i++) printf("%d ",d[i]); puts("");
	//for (int i=1;i<=t2;i++) printf("%d ",e[i]); puts("");
	//printf("l=%d,fd=%d\n",l,fd);
	//puts("OK");
	if (fd) {
		if (pos[e[fd]]<l) {
			for (int i=1;i<=t1;i++) ans.push_back(D[i]);
			for (int i=l-1;i>=1;i--) ans.push_back(D[i]);
			for (int i=1;i<fd;i++) ans.push_back(E[i]);
			for (int i=pos[e[fd]];i<l;i++) ans.push_back(D[i]);
			for (int i=t1;i>=pos[e[fd]];i--) ans.push_back(D[i]);
			for (int i=fd-1;i>=1;i--) ans.push_back(E[i]);
		} else {
			for (int i=1;i<=t1;i++) ans.push_back(D[i]);
			for (int i=l-1;i>=1;i--) ans.push_back(D[i]);
			for (int i=1;i<fd;i++) ans.push_back(E[i]);
			for (int i=pos[e[fd]]-1;i>=l;i--) ans.push_back(D[i]);
			for (int i=t1;i>=pos[e[fd]];i--) ans.push_back(D[i]);
			for (int i=fd-1;i>=1;i--) ans.push_back(E[i]);
		}
	} else {
		for (int i=1;i<=t1;i++) ans.push_back(D[i]);
		for (int i=l-1;i>=1;i--) ans.push_back(D[i]);
		for (int i=1;i<=t2;i++) ans.push_back(E[i]);
		for (int i=r-1;i>=1;i--) ans.push_back(E[i]);
		
		for (int i=1;i<l;i++) ans.push_back(D[i]);
		for (int i=t1;i>=1;i--) ans.push_back(D[i]);
		for (int i=1;i<r;i++) ans.push_back(E[i]);
		for (int i=t2;i>=1;i--) ans.push_back(E[i]);
	}
	for (int &x : vec) res.push_back(x);
	for (int &x : ans) res.push_back(x);
	reverse(vec.begin(),vec.end());
	for (int &x : vec) res.push_back(x);
/*	for (int &x : res) printf("%d ",x); puts("");
int now=0;
for (int &x : res) {
	printf("%d %d %d\n",x,U[x],V[x]);
	if (at[x]) assert(now==V[x]); else assert(now==U[x]);
	at[x]^=1,now=(V[x]^U[x]^now);
}
assert(now==0);
for (int i=0;i<m;i++) assert(!at[i]);*/

	return res;
}

Compilation message

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:21:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   21 |     for (int i=0;i<n;i++) if (!out[i]) q[++tl]=i,del[i]=1; hd=1;
      |     ^~~
islands.cpp:21:60: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   21 |     for (int i=0;i<n;i++) if (!out[i]) q[++tl]=i,del[i]=1; hd=1;
      |                                                            ^~
islands.cpp:46:8: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   46 |  int l,r;
      |        ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5332 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 38 ms 11176 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5332 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 36 ms 10472 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5588 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5384 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 5 ms 5460 KB Output is correct
9 Correct 3 ms 5332 KB Output is correct
10 Correct 4 ms 5460 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 4 ms 5460 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 4 ms 4948 KB Output is correct
15 Correct 3 ms 5460 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 25 ms 8620 KB Output is correct
18 Correct 19 ms 8276 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 4 ms 5332 KB Output is correct
21 Correct 3 ms 5332 KB Output is correct
22 Correct 3 ms 5332 KB Output is correct
23 Correct 34 ms 10500 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5460 KB Output is correct
2 Correct 4 ms 5588 KB Output is correct
3 Correct 37 ms 11032 KB Output is correct
4 Correct 38 ms 11508 KB Output is correct
5 Correct 4 ms 5588 KB Output is correct
6 Correct 4 ms 5588 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 2 ms 5332 KB Output is correct
9 Correct 3 ms 5332 KB Output is correct
10 Correct 5 ms 5588 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 4 ms 5588 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 4 ms 5588 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct
16 Correct 4 ms 5460 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 5588 KB Output is correct
19 Correct 3 ms 5460 KB Output is correct
20 Correct 39 ms 11324 KB Output is correct
21 Correct 42 ms 11600 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5460 KB Output is correct
26 Correct 3 ms 5588 KB Output is correct
27 Correct 40 ms 11880 KB Output is correct
28 Correct 46 ms 11972 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 55 ms 11960 KB Output is correct
31 Correct 3 ms 5332 KB Output is correct
32 Correct 39 ms 11796 KB Output is correct
33 Correct 37 ms 11484 KB Output is correct
34 Correct 24 ms 8660 KB Output is correct
35 Correct 4 ms 5460 KB Output is correct
36 Correct 36 ms 10752 KB Output is correct
37 Correct 45 ms 12132 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 34 ms 10436 KB Output is correct
40 Correct 4 ms 5588 KB Output is correct
41 Correct 46 ms 11968 KB Output is correct
42 Correct 42 ms 11988 KB Output is correct
43 Correct 3 ms 4948 KB Output is correct
44 Correct 4 ms 5076 KB Output is correct
45 Correct 4 ms 5588 KB Output is correct
46 Correct 21 ms 8208 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5332 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 38 ms 11176 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 3 ms 5332 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 36 ms 10472 KB Output is correct
14 Correct 4 ms 5588 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5384 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5332 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 5 ms 5460 KB Output is correct
22 Correct 3 ms 5332 KB Output is correct
23 Correct 4 ms 5460 KB Output is correct
24 Correct 3 ms 5332 KB Output is correct
25 Correct 4 ms 5460 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 4 ms 4948 KB Output is correct
28 Correct 3 ms 5460 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 25 ms 8620 KB Output is correct
31 Correct 19 ms 8276 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 4 ms 5332 KB Output is correct
34 Correct 3 ms 5332 KB Output is correct
35 Correct 3 ms 5332 KB Output is correct
36 Correct 34 ms 10500 KB Output is correct
37 Correct 3 ms 5332 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 20 ms 7908 KB Output is correct
42 Correct 5 ms 5204 KB Output is correct
43 Correct 40 ms 10592 KB Output is correct
44 Correct 42 ms 10528 KB Output is correct
45 Correct 38 ms 10948 KB Output is correct
46 Correct 3 ms 5332 KB Output is correct
47 Correct 3 ms 5332 KB Output is correct
48 Correct 4 ms 5332 KB Output is correct
49 Correct 4 ms 5588 KB Output is correct
50 Correct 100 ms 20108 KB Output is correct
51 Correct 113 ms 16044 KB Output is correct
52 Correct 90 ms 16068 KB Output is correct
53 Correct 104 ms 17304 KB Output is correct
54 Correct 115 ms 16036 KB Output is correct
55 Correct 95 ms 15960 KB Output is correct
56 Correct 99 ms 16428 KB Output is correct
57 Correct 85 ms 14588 KB Output is correct
58 Correct 94 ms 19028 KB Output is correct
59 Correct 106 ms 15376 KB Output is correct
60 Correct 117 ms 14668 KB Output is correct
61 Correct 97 ms 14772 KB Output is correct
62 Correct 16 ms 7320 KB Output is correct
63 Correct 98 ms 14448 KB Output is correct
64 Correct 27 ms 9004 KB Output is correct
65 Correct 3 ms 5332 KB Output is correct
66 Correct 3 ms 5460 KB Output is correct
67 Correct 101 ms 16508 KB Output is correct
68 Correct 45 ms 11960 KB Output is correct
69 Correct 51 ms 11692 KB Output is correct
70 Correct 3 ms 5588 KB Output is correct
71 Correct 59 ms 11848 KB Output is correct
72 Correct 3 ms 5332 KB Output is correct
73 Correct 105 ms 14260 KB Output is correct
74 Correct 93 ms 19292 KB Output is correct
75 Correct 6 ms 5844 KB Output is correct
76 Correct 37 ms 11276 KB Output is correct
77 Correct 66 ms 13860 KB Output is correct
78 Correct 91 ms 14704 KB Output is correct
79 Correct 3 ms 5332 KB Output is correct
80 Correct 121 ms 19368 KB Output is correct
81 Correct 4 ms 5588 KB Output is correct
82 Correct 36 ms 11168 KB Output is correct
83 Correct 3 ms 5460 KB Output is correct
84 Correct 3 ms 5332 KB Output is correct
85 Correct 39 ms 11716 KB Output is correct
86 Correct 4 ms 5588 KB Output is correct
87 Correct 4 ms 5844 KB Output is correct
88 Correct 4 ms 5588 KB Output is correct
89 Correct 107 ms 14668 KB Output is correct
90 Correct 104 ms 14852 KB Output is correct
91 Correct 110 ms 18620 KB Output is correct
92 Correct 3 ms 5332 KB Output is correct