oj.uz

Submission #115992

# Submission time Handle Problem Language Result Execution time Memory
115992 2019-06-10T06:45:40 Z ckodser Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 55656 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()){
	ll e=ger[a][l[a]];
	l[a]++;
	if(!vis[e]){
	    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:49: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:51: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]);
  ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12136 KB Output is correct
2 Correct 17 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 14 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 21 ms 12976 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 53 ms 17500 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 65 ms 17660 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 17 ms 12160 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 15 ms 12264 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 17 ms 12288 KB Output is correct
7 Correct 20 ms 13032 KB Output is correct
8 Correct 16 ms 12288 KB Output is correct
9 Correct 53 ms 17528 KB Output is correct
10 Correct 0 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 57 ms 17656 KB Output is correct
13 Correct 108 ms 20728 KB Output is correct
14 Correct 104 ms 18108 KB Output is correct
15 Correct 89 ms 19312 KB Output is correct
16 Correct 122 ms 20732 KB Output is correct
17 Correct 104 ms 16560 KB Output is correct
18 Correct 89 ms 18680 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12160 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 18 ms 13088 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 54 ms 17416 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 69 ms 17784 KB Output is correct
13 Correct 111 ms 20728 KB Output is correct
14 Correct 94 ms 18040 KB Output is correct
15 Correct 98 ms 19312 KB Output is correct
16 Correct 109 ms 20728 KB Output is correct
17 Correct 107 ms 16480 KB Output is correct
18 Correct 102 ms 18784 KB Output is correct
19 Execution timed out 612 ms 55656 KB Time limit exceeded
20 Halted 0 ms 0 KB -