oj.uz

Submission #881865

# Submission time Handle Problem Language Result Execution time Memory
881865 2023-12-02T05:32:58 Z djs100201 Thousands Islands (IOI22_islands) C++17
100 / 100
 219 ms 43092 KB 
#include "islands.h"
#include <variant>
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll = int;
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;
ll prob[n_],out[n_],checked[n_];
set<P>v[n_],edge[n_],rev[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]].insert({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()){
				x=q.front();
				q.pop();
				for(auto nxt:v[x])rev[nxt.first].erase({x,nxt.second});
				for(auto nxt:rev[x]){
					v[nxt.first].erase({x,nxt.second});
					if(v[nxt.first].size()==0)q.push(nxt.first);
				}
				v[x].clear(),rev[x].clear();
			}
	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;
			q.push(now);
			ll tmp=(*v[now].begin()).first;
			while(q.size()){
				x=q.front();
				q.pop();
				for(auto nxt:v[x])rev[nxt.first].erase({x,nxt.second});
				for(auto nxt:rev[x]){
					v[nxt.first].erase({x,nxt.second});
					if(v[nxt.first].size()==0)q.push(nxt.first);
				}
				v[x].clear(),rev[x].clear();
			}
			now = tmp;
		}
		else{
			for(int i=0;i<n;i++){
				if(i==now || !v[i].size())continue;
				auto cur=*v[i].begin();
				edge[i].insert(cur);
			}
			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==x && cnt==0)break;
			}
			break;
		}
	}
	reverse(all(ret_rev));
	for(auto i:ret_rev)ret.push_back(i);
    return ret;
}

Compilation message

islands.cpp:9:40: warning: integer overflow in expression of type 'll' {aka 'int'} results in '1321730048' [-Woverflow]
    9 | const ll n_ = 1e5 + 505, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
      |                                ~~~~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15196 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 89 ms 37728 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15196 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 112 ms 33280 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15708 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 4 ms 15448 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 3 ms 15284 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 3 ms 15196 KB Output is correct
10 Correct 4 ms 15452 KB Output is correct
11 Correct 3 ms 15028 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15196 KB Output is correct
14 Correct 3 ms 15196 KB Output is correct
15 Correct 3 ms 15192 KB Output is correct
16 Correct 3 ms 15196 KB Output is correct
17 Correct 57 ms 27332 KB Output is correct
18 Correct 43 ms 24912 KB Output is correct
19 Correct 3 ms 15192 KB Output is correct
20 Correct 3 ms 15196 KB Output is correct
21 Correct 3 ms 15196 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 114 ms 34364 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15392 KB Output is correct
2 Correct 6 ms 15452 KB Output is correct
3 Correct 131 ms 35412 KB Output is correct
4 Correct 132 ms 35664 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 4 ms 15708 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 3 ms 15196 KB Output is correct
10 Correct 6 ms 15404 KB Output is correct
11 Correct 4 ms 15572 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15960 KB Output is correct
14 Correct 4 ms 15704 KB Output is correct
15 Correct 5 ms 15964 KB Output is correct
16 Correct 4 ms 15448 KB Output is correct
17 Correct 3 ms 15196 KB Output is correct
18 Correct 4 ms 15452 KB Output is correct
19 Correct 4 ms 15452 KB Output is correct
20 Correct 176 ms 37144 KB Output is correct
21 Correct 128 ms 35412 KB Output is correct
22 Correct 3 ms 15452 KB Output is correct
23 Correct 3 ms 15196 KB Output is correct
24 Correct 3 ms 15192 KB Output is correct
25 Correct 5 ms 15448 KB Output is correct
26 Correct 4 ms 15704 KB Output is correct
27 Correct 156 ms 36640 KB Output is correct
28 Correct 137 ms 36692 KB Output is correct
29 Correct 3 ms 15192 KB Output is correct
30 Correct 151 ms 37028 KB Output is correct
31 Correct 3 ms 15192 KB Output is correct
32 Correct 171 ms 35412 KB Output is correct
33 Correct 136 ms 36640 KB Output is correct
34 Correct 52 ms 26452 KB Output is correct
35 Correct 3 ms 15196 KB Output is correct
36 Correct 121 ms 33364 KB Output is correct
37 Correct 132 ms 36692 KB Output is correct
38 Correct 3 ms 15452 KB Output is correct
39 Correct 107 ms 32052 KB Output is correct
40 Correct 4 ms 15452 KB Output is correct
41 Correct 149 ms 36964 KB Output is correct
42 Correct 139 ms 36680 KB Output is correct
43 Correct 3 ms 15192 KB Output is correct
44 Correct 4 ms 15452 KB Output is correct
45 Correct 4 ms 15564 KB Output is correct
46 Correct 40 ms 24148 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15196 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 89 ms 37728 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 3 ms 15196 KB Output is correct
10 Correct 3 ms 15196 KB Output is correct
11 Correct 3 ms 15196 KB Output is correct
12 Correct 3 ms 15196 KB Output is correct
13 Correct 112 ms 33280 KB Output is correct
14 Correct 4 ms 15708 KB Output is correct
15 Correct 3 ms 15196 KB Output is correct
16 Correct 3 ms 15196 KB Output is correct
17 Correct 3 ms 15196 KB Output is correct
18 Correct 4 ms 15448 KB Output is correct
19 Correct 3 ms 15196 KB Output is correct
20 Correct 3 ms 15284 KB Output is correct
21 Correct 3 ms 15196 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 4 ms 15452 KB Output is correct
24 Correct 3 ms 15028 KB Output is correct
25 Correct 4 ms 15452 KB Output is correct
26 Correct 4 ms 15196 KB Output is correct
27 Correct 3 ms 15196 KB Output is correct
28 Correct 3 ms 15192 KB Output is correct
29 Correct 3 ms 15196 KB Output is correct
30 Correct 57 ms 27332 KB Output is correct
31 Correct 43 ms 24912 KB Output is correct
32 Correct 3 ms 15192 KB Output is correct
33 Correct 3 ms 15196 KB Output is correct
34 Correct 3 ms 15196 KB Output is correct
35 Correct 3 ms 15196 KB Output is correct
36 Correct 114 ms 34364 KB Output is correct
37 Correct 3 ms 15228 KB Output is correct
38 Correct 3 ms 15196 KB Output is correct
39 Correct 4 ms 15196 KB Output is correct
40 Correct 3 ms 15196 KB Output is correct
41 Correct 69 ms 25524 KB Output is correct
42 Correct 5 ms 15708 KB Output is correct
43 Correct 65 ms 27516 KB Output is correct
44 Correct 93 ms 27516 KB Output is correct
45 Correct 64 ms 27476 KB Output is correct
46 Correct 3 ms 15196 KB Output is correct
47 Correct 3 ms 15196 KB Output is correct
48 Correct 3 ms 15204 KB Output is correct
49 Correct 4 ms 15228 KB Output is correct
50 Correct 127 ms 30524 KB Output is correct
51 Correct 191 ms 39760 KB Output is correct
52 Correct 190 ms 39820 KB Output is correct
53 Correct 200 ms 40612 KB Output is correct
54 Correct 219 ms 40272 KB Output is correct
55 Correct 206 ms 40244 KB Output is correct
56 Correct 193 ms 40252 KB Output is correct
57 Correct 162 ms 43092 KB Output is correct
58 Correct 122 ms 32200 KB Output is correct
59 Correct 174 ms 40528 KB Output is correct
60 Correct 188 ms 40140 KB Output is correct
61 Correct 168 ms 40200 KB Output is correct
62 Correct 18 ms 19460 KB Output is correct
63 Correct 129 ms 39068 KB Output is correct
64 Correct 77 ms 27216 KB Output is correct
65 Correct 3 ms 15192 KB Output is correct
66 Correct 3 ms 15192 KB Output is correct
67 Correct 162 ms 40932 KB Output is correct
68 Correct 202 ms 38616 KB Output is correct
69 Correct 63 ms 28240 KB Output is correct
70 Correct 5 ms 15472 KB Output is correct
71 Correct 128 ms 33956 KB Output is correct
72 Correct 3 ms 15228 KB Output is correct
73 Correct 167 ms 39812 KB Output is correct
74 Correct 102 ms 33768 KB Output is correct
75 Correct 8 ms 16472 KB Output is correct
76 Correct 38 ms 23312 KB Output is correct
77 Correct 57 ms 27984 KB Output is correct
78 Correct 179 ms 40204 KB Output is correct
79 Correct 3 ms 15196 KB Output is correct
80 Correct 214 ms 42188 KB Output is correct
81 Correct 4 ms 15196 KB Output is correct
82 Correct 145 ms 37836 KB Output is correct
83 Correct 4 ms 15196 KB Output is correct
84 Correct 3 ms 15032 KB Output is correct
85 Correct 48 ms 23172 KB Output is correct
86 Correct 4 ms 15452 KB Output is correct
87 Correct 5 ms 16276 KB Output is correct
88 Correct 5 ms 15708 KB Output is correct
89 Correct 178 ms 40356 KB Output is correct
90 Correct 183 ms 40276 KB Output is correct
91 Correct 182 ms 41684 KB Output is correct
92 Correct 3 ms 15196 KB Output is correct