oj.uz

답안 #150916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150916 2019-09-01T10:59:43 Z cheetose 어르신 집배원 (BOI14_postmen) C++11
100 / 100
 488 ms 51764 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];
VPi v[500005];
bool chk[500005],instack[500005];
int st[500005],T;
void dfs(int N)
{
	for(int &i=now[N];i<v[N].size();i++)
	{
		if(chk[v[N][i].Y])continue;
		chk[v[N][i].Y]=1;
		dfs(v[N][i].X);
	}
	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() {
	int n=RI(),m=RI();
	fup(i,0,m-1,1)
	{
		int x=RI(),y=RI();
		v[x].pb(mp(y,i));
		v[y].pb(mp(x,i));
	}
	dfs(1);
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:90:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int &i=now[N];i<v[N].size();i++)
                    ~^~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:113:6: warning: unused variable 'n' [-Wunused-variable]
  int n=RI(),m=RI();
      ^

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 13 ms 12024 KB Output is correct
4 Correct 15 ms 12264 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 19 ms 13056 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 39 ms 17632 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 52 ms 18036 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12136 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 13 ms 12160 KB Output is correct
9 Correct 41 ms 17660 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 44 ms 17912 KB Output is correct
13 Correct 73 ms 20008 KB Output is correct
14 Correct 68 ms 17784 KB Output is correct
15 Correct 63 ms 18796 KB Output is correct
16 Correct 69 ms 19960 KB Output is correct
17 Correct 89 ms 16228 KB Output is correct
18 Correct 85 ms 18508 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12080 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 19 ms 12372 KB Output is correct
7 Correct 27 ms 13184 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 46 ms 17656 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 17 ms 12288 KB Output is correct
12 Correct 45 ms 17920 KB Output is correct
13 Correct 84 ms 19960 KB Output is correct
14 Correct 73 ms 17784 KB Output is correct
15 Correct 73 ms 18760 KB Output is correct
16 Correct 76 ms 19924 KB Output is correct
17 Correct 69 ms 16248 KB Output is correct
18 Correct 84 ms 18392 KB Output is correct
19 Correct 458 ms 51764 KB Output is correct
20 Correct 427 ms 40928 KB Output is correct
21 Correct 407 ms 45516 KB Output is correct
22 Correct 485 ms 51720 KB Output is correct
23 Correct 160 ms 38912 KB Output is correct
24 Correct 488 ms 32696 KB Output is correct
25 Correct 450 ms 44320 KB Output is correct