oj.uz

Submission #413931

# Submission time Handle Problem Language Result Execution time Memory
413931 2021-05-29T17:39:25 Z Blagojce Senior Postmen (BOI14_postmen) C++17
100 / 100
 404 ms 79828 KB 
#include <bits/stdc++.h>
#include <cstdio>
#pragma GCC optimize("O3")
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 5*1e5+5;
 
 
 
inline int readint(){
	int ret=0;
	for(char c;;){
		c=getchar_unlocked();
		if('0'<=c and c<='9')
			ret=ret*10+(c&15);
		else
			return ret;
	}
}
vector<char> digits;
inline void printint(int x){
	do{
		digits.push_back(x%10|48);
		x/=10;
	}while(x);
	while(not digits.empty())
		putchar(digits.back()), digits.pop_back();
}
 
 
 
 
int n, m;
vector<int> g[mxn];
int deg[mxn];
bool used[mxn];
int l[mxn], r[mxn];
 
vector<int> cycle;
 
void euler(int u){
	while(deg[u] > 0){
		int e = g[u][deg[u]-1];
		int v = l[e];
		if(v == u) v = r[e];
		--deg[u];
		
		if(used[e]) continue;
		used[e] = true;
		
		euler(v);
	}
	cycle.pb(u);
}
bool vis[mxn];
 
int main(){
	digits.reserve(10);
	n=readint(), m=readint();
	fr(i, 0, m){
		l[i] = readint(), r[i] = readint();
		--l[i], --r[i];
		++deg[l[i]];
		++deg[r[i]];
		g[l[i]].pb(i);
		g[r[i]].pb(i);
	}
	euler(0);
	stack<int> S;
	for(auto u : cycle){
		if(vis[u]){
			while(1){
				int x = S.top();
				printint(x+1);
				putchar(' ');
				S.pop();
				vis[x] = false;
				if(x == u){
					putchar('\n');
					break;
				}
			}
		}
		vis[u] = true;
		S.push(u);
	}
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 8 ms 12052 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 8 ms 12340 KB Output is correct
5 Correct 8 ms 12108 KB Output is correct
6 Correct 9 ms 12408 KB Output is correct
7 Correct 13 ms 13644 KB Output is correct
8 Correct 10 ms 12272 KB Output is correct
9 Correct 28 ms 21388 KB Output is correct
10 Correct 8 ms 12236 KB Output is correct
11 Correct 8 ms 12236 KB Output is correct
12 Correct 33 ms 21696 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 8 ms 11976 KB Output is correct
4 Correct 9 ms 12304 KB Output is correct
5 Correct 8 ms 12084 KB Output is correct
6 Correct 9 ms 12420 KB Output is correct
7 Correct 11 ms 13600 KB Output is correct
8 Correct 8 ms 12236 KB Output is correct
9 Correct 29 ms 21412 KB Output is correct
10 Correct 9 ms 12236 KB Output is correct
11 Correct 8 ms 12300 KB Output is correct
12 Correct 33 ms 21572 KB Output is correct
13 Correct 59 ms 24516 KB Output is correct
14 Correct 46 ms 20264 KB Output is correct
15 Correct 52 ms 23212 KB Output is correct
16 Correct 60 ms 24480 KB Output is correct
17 Correct 48 ms 17528 KB Output is correct
18 Correct 55 ms 21824 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12028 KB Output is correct
2 Correct 8 ms 12040 KB Output is correct
3 Correct 8 ms 11980 KB Output is correct
4 Correct 9 ms 12324 KB Output is correct
5 Correct 9 ms 12096 KB Output is correct
6 Correct 9 ms 12492 KB Output is correct
7 Correct 11 ms 13644 KB Output is correct
8 Correct 9 ms 12184 KB Output is correct
9 Correct 30 ms 21400 KB Output is correct
10 Correct 9 ms 12260 KB Output is correct
11 Correct 9 ms 12316 KB Output is correct
12 Correct 33 ms 21572 KB Output is correct
13 Correct 62 ms 24656 KB Output is correct
14 Correct 46 ms 20328 KB Output is correct
15 Correct 51 ms 23192 KB Output is correct
16 Correct 58 ms 24588 KB Output is correct
17 Correct 48 ms 17596 KB Output is correct
18 Correct 49 ms 21808 KB Output is correct
19 Correct 395 ms 73600 KB Output is correct
20 Correct 349 ms 58640 KB Output is correct
21 Correct 333 ms 70892 KB Output is correct
22 Correct 401 ms 79828 KB Output is correct
23 Correct 117 ms 59864 KB Output is correct
24 Correct 383 ms 44036 KB Output is correct
25 Correct 404 ms 65836 KB Output is correct