oj.uz

Submission #150917

# Submission time Handle Problem Language Result Execution time Memory
150917 2019-09-01T11:03:33 Z cheetose Senior Postmen (BOI14_postmen) C++11
100 / 100
 293 ms 34040 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int RI() {
	bool minus = false;
	int result = 0;
	char ch;
	ch = getchar();
	while (true) {
		if (ch == '-') break;
		if (ch >= '0' && ch <= '9') break;
		ch = getchar();
	}
	if (ch == '-') minus = true; else result = ch-'0';
	while (true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result*10 + (ch - '0');
	}
	if (minus)
		return -result;
	else
		return result;
}
int now[500005];
bool chk[500005],instack[500005];
int st[500005],T;
int c, to[1000005], pre[1000005], last[1000005], junk[1000005];
void addedge(int a,int b)
{
	to[c] = b; pre[c] = last[a]; last[a] = c++;
	to[c] = a; pre[c] = last[b]; last[b] = c++;	
}
void dfs(int N)
{
	while (last[N]!=-1) 
	{
		int next=last[N];
		last[N]=pre[next];
		if (!chk[next>>1]) {
			chk[next>>1]=1;
			dfs(to[next]);
		}
	}
	if(instack[N])
	{
		while(T)
		{
			int t=st[T];
			printf("%d",t);
			if(t==N)puts("");
			else putchar(' ');
			instack[t]=0;
			T--;
			if(t==N)break;
		}
	}
	st[++T]=N;
	instack[N]=1;
}
int main() {
	MEM_1(last);
	int n=RI(),m=RI();
	fup(i,0,m-1,1)
	{
		int x=RI(),y=RI();
		addedge(x,y);
	}
	dfs(1);
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:122:6: warning: unused variable 'n' [-Wunused-variable]
  int n=RI(),m=RI();
      ^

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4352 KB Output is correct
3 Correct 7 ms 4352 KB Output is correct
4 Correct 9 ms 4480 KB Output is correct
5 Correct 7 ms 4352 KB Output is correct
6 Correct 8 ms 4480 KB Output is correct
7 Correct 10 ms 4992 KB Output is correct
8 Correct 7 ms 4328 KB Output is correct
9 Correct 33 ms 9448 KB Output is correct
10 Correct 8 ms 4352 KB Output is correct
11 Correct 8 ms 4456 KB Output is correct
12 Correct 36 ms 9472 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4224 KB Output is correct
2 Correct 9 ms 4224 KB Output is correct
3 Correct 6 ms 4224 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 7 ms 4352 KB Output is correct
6 Correct 9 ms 4480 KB Output is correct
7 Correct 10 ms 4992 KB Output is correct
8 Correct 9 ms 4352 KB Output is correct
9 Correct 34 ms 9472 KB Output is correct
10 Correct 7 ms 4352 KB Output is correct
11 Correct 7 ms 4352 KB Output is correct
12 Correct 49 ms 9464 KB Output is correct
13 Correct 45 ms 10080 KB Output is correct
14 Correct 37 ms 8312 KB Output is correct
15 Correct 37 ms 9568 KB Output is correct
16 Correct 39 ms 10112 KB Output is correct
17 Correct 41 ms 6776 KB Output is correct
18 Correct 39 ms 9080 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4352 KB Output is correct
2 Correct 6 ms 4224 KB Output is correct
3 Correct 7 ms 4352 KB Output is correct
4 Correct 7 ms 4480 KB Output is correct
5 Correct 7 ms 4352 KB Output is correct
6 Correct 10 ms 4512 KB Output is correct
7 Correct 13 ms 5120 KB Output is correct
8 Correct 8 ms 4352 KB Output is correct
9 Correct 32 ms 9448 KB Output is correct
10 Correct 7 ms 4352 KB Output is correct
11 Correct 8 ms 4352 KB Output is correct
12 Correct 37 ms 9448 KB Output is correct
13 Correct 37 ms 10104 KB Output is correct
14 Correct 39 ms 8312 KB Output is correct
15 Correct 39 ms 9600 KB Output is correct
16 Correct 39 ms 10104 KB Output is correct
17 Correct 44 ms 6784 KB Output is correct
18 Correct 40 ms 9088 KB Output is correct
19 Correct 246 ms 34040 KB Output is correct
20 Correct 237 ms 25056 KB Output is correct
21 Correct 226 ms 31224 KB Output is correct
22 Correct 239 ms 34016 KB Output is correct
23 Correct 137 ms 30124 KB Output is correct
24 Correct 293 ms 17528 KB Output is correct
25 Correct 259 ms 28512 KB Output is correct