oj.uz

Submission #881852

# Submission time Handle Problem Language Result Execution time Memory
881852 2023-12-02T05:10:17 Z djs100201 Thousands Islands (IOI22_islands) C++17
34 / 100
 1000 ms 148624 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_ = 1e5 + 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){
		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 it=v[now].end();
			it--;
			edge[now].insert(*it);
			it--;
			edge[now].insert(*it);
			x=now;
			ll bef=-1,cnt=0;
			vector<int>inv(m);
			while(1){
				P nxt;
				for(auto i:edge[x]){
					if(i.second==bef)continue;
					nxt=i;
					bef=i.second;
					break;
				}
				if(inv[nxt.second])cnt--;
				else cnt++;
				inv[nxt.second]^=1;
				edge[nxt.first].insert({x,nxt.second});
				edge[x].erase(nxt);
				ret.push_back(nxt.second);
				x=nxt.first;
				if(now==0 && cnt==0)break;
			}
			break;
		}
	}
	reverse(all(ret_rev));
	for(auto i:ret_rev)ret.push_back(i);
    return ret;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15964 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 4 ms 15964 KB Output is correct
4 Correct 3 ms 15964 KB Output is correct
5 Correct 3 ms 15964 KB Output is correct
6 Correct 3 ms 15964 KB Output is correct
7 Correct 67 ms 35360 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15960 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 4 ms 15964 KB Output is correct
4 Correct 3 ms 15964 KB Output is correct
5 Correct 3 ms 15960 KB Output is correct
6 Correct 77 ms 32156 KB Output is correct

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16476 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 3 ms 15964 KB Output is correct
4 Execution timed out 1093 ms 148624 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15960 KB Output is correct
2 Correct 5 ms 16220 KB Output is correct
3 Correct 96 ms 34048 KB Output is correct
4 Correct 86 ms 34560 KB Output is correct
5 Correct 4 ms 16220 KB Output is correct
6 Correct 4 ms 16220 KB Output is correct
7 Correct 3 ms 15960 KB Output is correct
8 Correct 3 ms 15964 KB Output is correct
9 Correct 4 ms 15964 KB Output is correct
10 Correct 4 ms 16220 KB Output is correct
11 Correct 6 ms 16240 KB Output is correct
12 Correct 5 ms 16220 KB Output is correct
13 Correct 5 ms 16476 KB Output is correct
14 Correct 5 ms 16476 KB Output is correct
15 Correct 5 ms 16476 KB Output is correct
16 Correct 4 ms 16220 KB Output is correct
17 Correct 5 ms 15976 KB Output is correct
18 Correct 4 ms 16220 KB Output is correct
19 Correct 4 ms 16216 KB Output is correct
20 Correct 102 ms 34896 KB Output is correct
21 Correct 87 ms 34852 KB Output is correct
22 Correct 4 ms 15960 KB Output is correct
23 Correct 5 ms 15964 KB Output is correct
24 Correct 3 ms 15964 KB Output is correct
25 Correct 4 ms 15980 KB Output is correct
26 Correct 5 ms 16220 KB Output is correct
27 Correct 91 ms 35232 KB Output is correct
28 Correct 91 ms 35148 KB Output is correct
29 Correct 3 ms 15964 KB Output is correct
30 Correct 98 ms 36264 KB Output is correct
31 Correct 4 ms 15964 KB Output is correct
32 Correct 88 ms 34248 KB Output is correct
33 Correct 97 ms 34720 KB Output is correct
34 Correct 45 ms 26572 KB Output is correct
35 Correct 4 ms 15960 KB Output is correct
36 Correct 81 ms 32344 KB Output is correct
37 Correct 86 ms 35860 KB Output is correct
38 Correct 4 ms 15964 KB Output is correct
39 Correct 78 ms 31292 KB Output is correct
40 Correct 5 ms 16220 KB Output is correct
41 Correct 103 ms 36340 KB Output is correct
42 Correct 97 ms 35136 KB Output is correct
43 Correct 3 ms 15964 KB Output is correct
44 Correct 5 ms 16332 KB Output is correct
45 Correct 4 ms 16220 KB Output is correct
46 Correct 28 ms 24588 KB Output is correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15964 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 4 ms 15964 KB Output is correct
4 Correct 3 ms 15964 KB Output is correct
5 Correct 3 ms 15964 KB Output is correct
6 Correct 3 ms 15964 KB Output is correct
7 Correct 67 ms 35360 KB Output is correct
8 Correct 3 ms 15960 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 4 ms 15964 KB Output is correct
11 Correct 3 ms 15964 KB Output is correct
12 Correct 3 ms 15960 KB Output is correct
13 Correct 77 ms 32156 KB Output is correct
14 Correct 5 ms 16476 KB Output is correct
15 Correct 3 ms 15964 KB Output is correct
16 Correct 3 ms 15964 KB Output is correct
17 Execution timed out 1093 ms 148624 KB Time limit exceeded
18 Halted 0 ms 0 KB -