oj.uz

Submission #881850

# Submission time Handle Problem Language Result Execution time Memory
881850 2023-12-02T04:34:17 Z djs100201 Thousands Islands (IOI22_islands) C++17
11.9 / 100
 1000 ms 51644 KB 
#include "islands.h"
#include <variant>
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 2e5 + 505, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
vector<P>rev[n_];
ll prob[n_],out[n_],checked[n_];
set<P>v[n_],edge[n_];
P To[n_];
variant<bool, std::vector<int>>find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
	n=N,m=M;
    for(int i=0;i<m;i++){
		out[U[i]]++;
		v[U[i]].insert({V[i],i});
		rev[V[i]].push_back({U[i],i});
	}
	fill(prob,prob+n+1,1);
	//가능성이 존재한다.
	queue<ll>q;
	for(int i=0;i<n;i++){
		if(v[i].size())continue;
		q.push(i);
	}
	while(q.size()){
		a=q.front();
		q.pop();
		prob[a]=0;
		for(auto nxt:rev[a]){
			v[nxt.first].erase({a,nxt.second});
			if(v[nxt.first].size()==0){
				q.push(nxt.first);
			}
		}
	}
	ll now=0;
	vector<int>ret,ret_rev;
	while(1){
		//cout<<now<<' '<<v[now].size()<<endl;
		if(!v[now].size())return false;
		if(v[now].size()==1){
			ret.push_back((*v[now].begin()).second);
			ret_rev.push_back((*v[now].begin()).second);
			queue<ll>q;
			for(auto nxt:rev[now]){
				v[nxt.first].erase({now,nxt.second});
				if(v[nxt.first].size()==0)q.push(nxt.first);
			}
			while(q.size()){
				x=q.front();
				q.pop();
				for(auto nxt:rev[x]){
					v[nxt.first].erase({now,nxt.second});
					if(v[nxt.first].size()==0)q.push(nxt.first);
				}
			}
			out[now]=0;
			now=(*v[now].begin()).first;
		}
		else{
			
			for(int i=0;i<n;i++){
				if(i==now || !v[i].size())continue;
				auto cur=*v[i].begin();
				//v[i].clear();
				edge[i].insert(cur);
				//cout<<i<<' '<<cur.first<<' '<<cur.second<<endl;
				//v[i].insert(a);
			}
			auto a=*v[now].begin();
			//cout<<a<<' '<<b<<endl;
			x=now;
			edge[now].clear();
			edge[now].insert(a);
			for(int i=0;i<n;i++)To[i]={-1,-1};
			while(1){
				P nxt;
				//cout<<x<<endl;
				if(edge[x].size()==1){
					nxt=*edge[x].begin();
				}
				else{
					for(auto i:edge[x]){
						if(i!=To[x])nxt=i;
					}
				}
				To[nxt.first]={x,nxt.second};
				//cout<<x<<' '<<nxt.first<<' '<<nxt.second<<endl;
				edge[nxt.first].insert({x,nxt.second});
				edge[x].erase(nxt);
				ret.push_back(nxt.second);
				x=nxt.first;
				if(x==now)break;
			}
			edge[now].clear();
			auto it=v[now].end();
			it--;
			//cout<<a<<' '<<b<<endl;
			x=now;
			edge[now].insert(*it);
			for(int i=0;i<n;i++)To[i]={-1,-1};
			base=0;
			while(1){
				P nxt;
				//cout<<x<<endl;
				if(edge[x].size()==1){
					nxt=*edge[x].begin();
				}
				else{
					for(auto i:edge[x]){
						if(i!=To[x])nxt=i;
					}
				}
				To[nxt.first]={x,nxt.second};
				//cout<<x<<' '<<nxt.first<<' '<<nxt.second<<endl;
				edge[nxt.first].insert({x,nxt.second});
				edge[x].erase(nxt);
				ret.push_back(nxt.second);
				x=nxt.first;
				if(x==now)break;
			}
			a=*v[now].begin();
			//cout<<a<<' '<<b<<endl;
			x=now;
			edge[now].clear();
			edge[now].insert(a);
			for(int i=0;i<n;i++)To[i]={-1,-1};
			while(1){
				P nxt;
				//cout<<x<<endl;
				if(edge[x].size()==1){
					nxt=*edge[x].begin();
				}
				else{
					for(auto i:edge[x]){
						if(i!=To[x])nxt=i;
					}
				}
				To[nxt.first]={x,nxt.second};
				//cout<<x<<' '<<nxt.first<<' '<<nxt.second<<endl;
				edge[nxt.first].insert({x,nxt.second});
				edge[x].erase(nxt);
				ret.push_back(nxt.second);
				x=nxt.first;
				if(x==now)break;
			}
			edge[now].clear();
			it=v[now].end();
			it--;
			//cout<<a<<' '<<b<<endl;
			x=now;
			edge[now].insert(*it);
			for(int i=0;i<n;i++)To[i]={-1,-1};
			base=0;
			while(1){
				P nxt;
				//cout<<x<<endl;
				if(edge[x].size()==1){
					nxt=*edge[x].begin();
				}
				else{
					for(auto i:edge[x]){
						if(i!=To[x])nxt=i;
					}
				}
				To[nxt.first]={x,nxt.second};
				//cout<<x<<' '<<nxt.first<<' '<<nxt.second<<endl;
				edge[nxt.first].insert({x,nxt.second});
				edge[x].erase(nxt);
				ret.push_back(nxt.second);
				x=nxt.first;
				if(x==now)break;
			}
			break;
		}
	}
	reverse(all(ret_rev));
	for(auto i:ret_rev)ret.push_back(i);
    return ret;
}

Subtask #1
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29540 KB Output is correct
2 Partially correct 6 ms 29532 KB Output is partially correct
3 Correct 7 ms 29528 KB Output is correct
4 Correct 8 ms 29532 KB Output is correct
5 Correct 5 ms 29532 KB Output is correct
6 Partially correct 6 ms 29532 KB Output is partially correct
7 Partially correct 61 ms 49184 KB Output is partially correct

Subtask #2
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 29528 KB Output is partially correct
2 Correct 5 ms 29532 KB Output is correct
3 Partially correct 5 ms 29532 KB Output is partially correct
4 Partially correct 5 ms 29592 KB Output is partially correct
5 Partially correct 5 ms 29532 KB Output is partially correct
6 Partially correct 79 ms 45276 KB Output is partially correct

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Partially correct 7 ms 30044 KB Output is partially correct
2 Correct 6 ms 29532 KB Output is correct
3 Correct 7 ms 29612 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Execution timed out 1095 ms 29588 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
8.4 / 24.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 29532 KB Output is partially correct
2 Partially correct 7 ms 29788 KB Output is partially correct
3 Partially correct 91 ms 46624 KB Output is partially correct
4 Partially correct 106 ms 47416 KB Output is partially correct
5 Partially correct 7 ms 30040 KB Output is partially correct
6 Partially correct 7 ms 30044 KB Output is partially correct
7 Partially correct 5 ms 29532 KB Output is partially correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 6 ms 29532 KB Output is correct
10 Correct 7 ms 29788 KB Output is correct
11 Correct 7 ms 29788 KB Output is correct
12 Correct 7 ms 30068 KB Output is correct
13 Partially correct 7 ms 30044 KB Output is partially correct
14 Partially correct 7 ms 30044 KB Output is partially correct
15 Correct 8 ms 30296 KB Output is correct
16 Correct 6 ms 29788 KB Output is correct
17 Correct 6 ms 29528 KB Output is correct
18 Correct 8 ms 30044 KB Output is correct
19 Partially correct 7 ms 29784 KB Output is partially correct
20 Correct 104 ms 49788 KB Output is correct
21 Partially correct 89 ms 49232 KB Output is partially correct
22 Correct 6 ms 29784 KB Output is correct
23 Correct 6 ms 29620 KB Output is correct
24 Correct 6 ms 29532 KB Output is correct
25 Correct 6 ms 29784 KB Output is correct
26 Correct 9 ms 29852 KB Output is correct
27 Partially correct 99 ms 49492 KB Output is partially correct
28 Partially correct 95 ms 49516 KB Output is partially correct
29 Correct 6 ms 29532 KB Output is correct
30 Correct 105 ms 51644 KB Output is correct
31 Partially correct 6 ms 29532 KB Output is partially correct
32 Correct 92 ms 48636 KB Output is correct
33 Correct 131 ms 48784 KB Output is correct
34 Partially correct 39 ms 40272 KB Output is partially correct
35 Correct 7 ms 29584 KB Output is correct
36 Correct 81 ms 46416 KB Output is correct
37 Correct 109 ms 50076 KB Output is correct
38 Correct 6 ms 29784 KB Output is correct
39 Correct 78 ms 45996 KB Output is correct
40 Correct 8 ms 30044 KB Output is correct
41 Correct 107 ms 51328 KB Output is correct
42 Partially correct 92 ms 49492 KB Output is partially correct
43 Correct 5 ms 29532 KB Output is correct
44 Correct 7 ms 29856 KB Output is correct
45 Correct 8 ms 29788 KB Output is correct
46 Correct 32 ms 38316 KB Output is correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29540 KB Output is correct
2 Partially correct 6 ms 29532 KB Output is partially correct
3 Correct 7 ms 29528 KB Output is correct
4 Correct 8 ms 29532 KB Output is correct
5 Correct 5 ms 29532 KB Output is correct
6 Partially correct 6 ms 29532 KB Output is partially correct
7 Partially correct 61 ms 49184 KB Output is partially correct
8 Partially correct 6 ms 29528 KB Output is partially correct
9 Correct 5 ms 29532 KB Output is correct
10 Partially correct 5 ms 29532 KB Output is partially correct
11 Partially correct 5 ms 29592 KB Output is partially correct
12 Partially correct 5 ms 29532 KB Output is partially correct
13 Partially correct 79 ms 45276 KB Output is partially correct
14 Partially correct 7 ms 30044 KB Output is partially correct
15 Correct 6 ms 29532 KB Output is correct
16 Correct 7 ms 29612 KB Output is correct
17 Correct 6 ms 29532 KB Output is correct
18 Execution timed out 1095 ms 29588 KB Time limit exceeded
19 Halted 0 ms 0 KB -