oj.uz

답안 #881854

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881854 2023-12-02T05:15:23 Z djs100201 수천개의 섬 (IOI22_islands) C++17
34 / 100
 1000 ms 145412 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;
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;
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13916 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 3 ms 13916 KB Output is correct
5 Correct 3 ms 13912 KB Output is correct
6 Correct 3 ms 13912 KB Output is correct
7 Correct 60 ms 28732 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13916 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 3 ms 13912 KB Output is correct
5 Correct 3 ms 13912 KB Output is correct
6 Correct 70 ms 26284 KB Output is correct

Subtask #3
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14172 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13984 KB Output is correct
4 Execution timed out 1038 ms 145412 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13912 KB Output is correct
2 Correct 4 ms 14172 KB Output is correct
3 Correct 91 ms 27464 KB Output is correct
4 Correct 79 ms 27844 KB Output is correct
5 Correct 4 ms 14168 KB Output is correct
6 Correct 4 ms 14424 KB Output is correct
7 Correct 3 ms 13916 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 3 ms 13912 KB Output is correct
10 Correct 4 ms 14168 KB Output is correct
11 Correct 4 ms 14172 KB Output is correct
12 Correct 5 ms 14424 KB Output is correct
13 Correct 4 ms 14428 KB Output is correct
14 Correct 4 ms 14168 KB Output is correct
15 Correct 4 ms 14428 KB Output is correct
16 Correct 3 ms 14172 KB Output is correct
17 Correct 3 ms 14024 KB Output is correct
18 Correct 4 ms 14172 KB Output is correct
19 Correct 3 ms 14048 KB Output is correct
20 Correct 91 ms 28416 KB Output is correct
21 Correct 95 ms 27980 KB Output is correct
22 Correct 3 ms 14172 KB Output is correct
23 Correct 3 ms 13916 KB Output is correct
24 Correct 3 ms 13928 KB Output is correct
25 Correct 3 ms 14172 KB Output is correct
26 Correct 4 ms 14172 KB Output is correct
27 Correct 86 ms 28296 KB Output is correct
28 Correct 81 ms 28500 KB Output is correct
29 Correct 3 ms 13912 KB Output is correct
30 Correct 85 ms 28660 KB Output is correct
31 Correct 3 ms 13912 KB Output is correct
32 Correct 84 ms 27864 KB Output is correct
33 Correct 85 ms 28496 KB Output is correct
34 Correct 32 ms 21580 KB Output is correct
35 Correct 3 ms 14168 KB Output is correct
36 Correct 70 ms 26308 KB Output is correct
37 Correct 74 ms 28772 KB Output is correct
38 Correct 4 ms 14372 KB Output is correct
39 Correct 74 ms 25432 KB Output is correct
40 Correct 4 ms 14172 KB Output is correct
41 Correct 90 ms 28752 KB Output is correct
42 Correct 87 ms 28500 KB Output is correct
43 Correct 3 ms 13916 KB Output is correct
44 Correct 4 ms 14172 KB Output is correct
45 Correct 4 ms 14276 KB Output is correct
46 Correct 27 ms 20304 KB Output is correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13916 KB Output is correct
2 Correct 3 ms 13916 KB Output is correct
3 Correct 3 ms 13916 KB Output is correct
4 Correct 3 ms 13916 KB Output is correct
5 Correct 3 ms 13912 KB Output is correct
6 Correct 3 ms 13912 KB Output is correct
7 Correct 60 ms 28732 KB Output is correct
8 Correct 3 ms 13916 KB Output is correct
9 Correct 3 ms 13916 KB Output is correct
10 Correct 3 ms 13916 KB Output is correct
11 Correct 3 ms 13912 KB Output is correct
12 Correct 3 ms 13912 KB Output is correct
13 Correct 70 ms 26284 KB Output is correct
14 Correct 4 ms 14172 KB Output is correct
15 Correct 3 ms 13916 KB Output is correct
16 Correct 3 ms 13984 KB Output is correct
17 Execution timed out 1038 ms 145412 KB Time limit exceeded
18 Halted 0 ms 0 KB -