Submission #628319

#	Time	Username	Problem	Language	Result	Execution time	Memory
628319		haojiandan	Thousands Islands (IOI22_islands)	C++17	15.15 / 100	46 ms	12108 KiB

islands

#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];
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; 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; }
	   	}
	   	for (int i=1;i<=tl;i++) del[q[i]]=1;
	   	if (del[0]) return false;
	   	while (out[x]==1) {
	   		del[x]=1;
	   		for (int &y : bk[x]) { out[y]--; if (!out[y]) q[++tl]=y; }
	   		bool fd=0;
	   		for (auto [y,id] : g[x]) if (!del[y]) { fd=1; vec.push_back(id); x=y; break; }
	   		if (!fd) 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);
	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<=t1;i++) ans.push_back(D[i]);
			for (int i=l-1;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=1;i<=t2;i++) ans.push_back(E[i]);
		for (int i=1;i<=t1;i++) ans.push_back(D[i]);
		for (int i=1;i<=t2;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("");
	return res;
}

Compilation message (stderr)

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:19:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   19 |     for (int i=0;i<n;i++) if (!out[i]) q[++tl]=i; hd=1;
      |     ^~~
islands.cpp:19:51: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   19 |     for (int i=0;i<n;i++) if (!out[i]) q[++tl]=i; hd=1;
      |                                                   ^~
islands.cpp:43:8: warning: variable 'r' set but not used [-Wunused-but-set-variable]
   43 |  int l,r;
      |        ^

• Subtask 1: 5 / 5
• Subtask 2: 1.75 / 5
• Subtask 3: 0 / 21
• Subtask 4: 8.399999999999999 / 24
• Subtask 5: 0 / 45