Submission #115986

# Submission time Handle Problem Language Result Execution time Memory
115986 2019-06-10T06:36:30 Z ckodser Senior Postmen (BOI14_postmen) C++14
55 / 100
500 ms 55780 KB
#include<bits/stdc++.h>

#define ll int
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll mod=1e9+7;
const ll maxn=5e5+500;
const ll inf=1e9+900;

vector<ll> ger[maxn];
ll s[maxn];
ll t[maxn];
bool vis[maxn];
ll l[maxn];
stack<ll> ans;
bool inAns[maxn];


void dfs(ll a){
    while(l[a]<ger[a].size()){
	if(vis[ger[a][l[a]]]){
	    l[a]++;
	}else{
	    ll e=ger[a][l[a]];
	    vis[e]=1;
	    dfs(s[e]^t[e]^a);
	}
    }
    if(inAns[a]){
	while(ans.top()!=a){
	    printf("%d ",ans.top());
	    inAns[ans.top()]=0;
	    ans.pop();
	}
	printf("%d\n",a);
    }else{
        ans.push(a);
	inAns[a]=1;
    }
}
int main(){
    ll n,m;
    scanf("%d%d",&n,&m);
    for(ll i=0;i<m;i++){
	scanf("%d%d",&s[i],&t[i]);
	ger[s[i]].pb(i);
	ger[t[i]].pb(i);
    }
    dfs(1);
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:27:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(l[a]<ger[a].size()){
           ~~~~^~~~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
postmen.cpp:52:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&s[i],&t[i]);
  ~~~~~^~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 14 ms 12288 KB Output is correct
5 Correct 11 ms 12140 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 18 ms 13056 KB Output is correct
8 Correct 13 ms 12320 KB Output is correct
9 Correct 63 ms 17400 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 56 ms 17764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 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 12364 KB Output is correct
5 Correct 13 ms 12136 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 23 ms 12928 KB Output is correct
8 Correct 19 ms 12288 KB Output is correct
9 Correct 56 ms 17524 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 17 ms 12288 KB Output is correct
12 Correct 66 ms 17676 KB Output is correct
13 Correct 95 ms 20728 KB Output is correct
14 Correct 122 ms 18016 KB Output is correct
15 Correct 97 ms 19264 KB Output is correct
16 Correct 103 ms 20728 KB Output is correct
17 Correct 115 ms 16480 KB Output is correct
18 Correct 97 ms 18712 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 17 ms 12288 KB Output is correct
7 Correct 23 ms 12928 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 51 ms 17480 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 58 ms 17688 KB Output is correct
13 Correct 108 ms 20728 KB Output is correct
14 Correct 93 ms 18016 KB Output is correct
15 Correct 91 ms 19204 KB Output is correct
16 Correct 97 ms 20768 KB Output is correct
17 Correct 110 ms 16504 KB Output is correct
18 Correct 86 ms 18680 KB Output is correct
19 Execution timed out 625 ms 55780 KB Time limit exceeded
20 Halted 0 ms 0 KB -