oj.uz

답안 #881799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881799 2023-12-02T02:01:49 Z djs100201 수천개의 섬 (IOI22_islands) C++17
11.9 / 100
 102 ms 51304 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=1;i<=n;i++){
		if(out[i])continue;
		q.push(i);
	}
	while(q.size()){
		a=q.front();
		q.pop();
		prob[a]=0;
		for(auto nxt:rev[a]){
			out[nxt.first]--;
			v[nxt.first].erase(nxt);
			if(out[nxt.first]==0){
				q.push(nxt.first);
			}
		}
	}
	ll now=0;
	vector<int>ret,ret_rev;
	while(1){
		if(!out[now])return false;
		if(out[now]==1){
			ret.push_back((*v[now].begin()).second);
			ret_rev.push_back((*v[now].begin()).second);
			queue<ll>q;
			for(auto nxt:rev[now]){
				out[nxt.first]--;
				v[nxt.first].erase(nxt);
				if(out[nxt.first]==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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 29532 KB Output is correct
2 Partially correct 5 ms 29584 KB Output is partially correct
3 Correct 7 ms 29532 KB Output is correct
4 Correct 6 ms 29784 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 58 ms 49092 KB Output is partially correct

Subtask #2
1.75 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 5 ms 29532 KB Output is partially correct
2 Correct 6 ms 29616 KB Output is correct
3 Partially correct 6 ms 29596 KB Output is partially correct
4 Partially correct 6 ms 29784 KB Output is partially correct
5 Partially correct 5 ms 29532 KB Output is partially correct
6 Partially correct 82 ms 46404 KB Output is partially correct

Subtask #3
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 7 ms 30040 KB Output is partially correct
2 Correct 6 ms 29532 KB Output is correct
3 Correct 6 ms 29532 KB Output is correct
4 Partially correct 6 ms 29616 KB Output is partially correct
5 Incorrect 7 ms 29876 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
8.4 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 6 ms 29532 KB Output is partially correct
2 Partially correct 7 ms 30044 KB Output is partially correct
3 Partially correct 87 ms 47696 KB Output is partially correct
4 Partially correct 87 ms 48840 KB Output is partially correct
5 Partially correct 7 ms 30044 KB Output is partially correct
6 Partially correct 7 ms 30088 KB Output is partially correct
7 Partially correct 6 ms 29532 KB Output is partially correct
8 Correct 5 ms 29608 KB Output is correct
9 Correct 6 ms 29608 KB Output is correct
10 Correct 7 ms 29788 KB Output is correct
11 Correct 7 ms 30040 KB Output is correct
12 Partially correct 8 ms 30044 KB Output is partially correct
13 Partially correct 8 ms 30084 KB Output is partially correct
14 Partially correct 7 ms 30044 KB Output is partially correct
15 Correct 8 ms 30300 KB Output is correct
16 Correct 6 ms 29784 KB Output is correct
17 Correct 6 ms 29532 KB Output is correct
18 Partially correct 7 ms 30044 KB Output is partially correct
19 Partially correct 6 ms 29784 KB Output is partially correct
20 Correct 101 ms 49748 KB Output is correct
21 Partially correct 90 ms 49236 KB Output is partially correct
22 Correct 7 ms 30040 KB Output is correct
23 Correct 6 ms 29532 KB Output is correct
24 Correct 6 ms 29532 KB Output is correct
25 Partially correct 6 ms 29788 KB Output is partially correct
26 Correct 7 ms 29736 KB Output is correct
27 Partially correct 92 ms 49404 KB Output is partially correct
28 Partially correct 90 ms 49568 KB Output is partially correct
29 Correct 6 ms 29532 KB Output is correct
30 Correct 102 ms 51304 KB Output is correct
31 Partially correct 6 ms 29532 KB Output is partially correct
32 Partially correct 85 ms 48680 KB Output is partially correct
33 Partially correct 94 ms 48724 KB Output is partially correct
34 Partially correct 42 ms 40528 KB Output is partially correct
35 Correct 6 ms 29788 KB Output is correct
36 Partially correct 74 ms 46676 KB Output is partially correct
37 Partially correct 83 ms 50384 KB Output is partially correct
38 Correct 6 ms 29784 KB Output is correct
39 Correct 74 ms 46160 KB Output is correct
40 Partially correct 7 ms 29788 KB Output is partially correct
41 Correct 95 ms 51256 KB Output is correct
42 Partially correct 89 ms 49744 KB Output is partially correct
43 Correct 6 ms 29532 KB Output is correct
44 Correct 7 ms 30044 KB Output is correct
45 Correct 7 ms 29788 KB Output is correct
46 Correct 37 ms 38536 KB Output is correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 29532 KB Output is correct
2 Partially correct 5 ms 29584 KB Output is partially correct
3 Correct 7 ms 29532 KB Output is correct
4 Correct 6 ms 29784 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 58 ms 49092 KB Output is partially correct
8 Partially correct 5 ms 29532 KB Output is partially correct
9 Correct 6 ms 29616 KB Output is correct
10 Partially correct 6 ms 29596 KB Output is partially correct
11 Partially correct 6 ms 29784 KB Output is partially correct
12 Partially correct 5 ms 29532 KB Output is partially correct
13 Partially correct 82 ms 46404 KB Output is partially correct
14 Partially correct 7 ms 30040 KB Output is partially correct
15 Correct 6 ms 29532 KB Output is correct
16 Correct 6 ms 29532 KB Output is correct
17 Partially correct 6 ms 29616 KB Output is partially correct
18 Incorrect 7 ms 29876 KB Output isn't correct
19 Halted 0 ms 0 KB -