oj.uz

Submission #31394

# Submission time Handle Problem Language Result Execution time Memory
31394 2017-08-20T22:01:31 Z imaxblue Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 92804 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()

int n, m, a, b, t, p[500005];
bool u[500005], u2[500005];
vector<pii> v[500005];
vector<int> s, ans;
set<int> S;
void dfs(int N){
    if (u[N]){
        t=-1;
        ans.clear();
        while(t!=N){
            //ans.pb(e.back()); e.pop_back();
            ans.pb(t=s.back()); s.pop_back();
            u[t]=0;
        }
        S.clear();
        reverse(ans.begin(), ans.end());
        fox(l, ans.size()){
            printf("%d ", ans[l]);
            if (S.find(ans[l])!=S.end()) exit(1);
            S.insert(ans[l]);
        }cout << endl;
    }
    //if (N>64800)
    //cout << N << endal;
    for(; p[N]<v[N].size(); ++p[N]){
        if (!u2[v[N][p[N]].y]){
            u[N]=1;
            s.pb(N);
            u2[v[N][p[N]].y]=1;
            //e.pb(v[N][p[N]].y);
            dfs(v[N][p[N]].x);
        }
    }
}
int main(){
    scanf("%i%i", &n, &m);
    fox(l, m){
        //a=l+1; b=(l==m-1 ? 1:l+2);
        scanf("%i%i", &a, &b);
        v[a].pb(mp(b, l+1));
        v[b].pb(mp(a, l+1));
    }
    dfs(1);
    return 0;
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
postmen.cpp:43:13:
         fox(l, ans.size()){
             ~~~~~~~~~~~~~         
postmen.cpp:43:9: note: in expansion of macro 'fox'
         fox(l, ans.size()){
         ^~~
postmen.cpp:51:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(; p[N]<v[N].size(); ++p[N]){
           ~~~~^~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
postmen.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 15 ms 12160 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 19 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 24 ms 13616 KB Output is correct
8 Correct 13 ms 12416 KB Output is correct
9 Correct 89 ms 20796 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 21 ms 12416 KB Output is correct
12 Correct 89 ms 21112 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12104 KB Output is correct
2 Correct 13 ms 12088 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 16 ms 12392 KB Output is correct
5 Correct 13 ms 12208 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 22 ms 13568 KB Output is correct
8 Correct 18 ms 12416 KB Output is correct
9 Correct 95 ms 20820 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 15 ms 12416 KB Output is correct
12 Correct 84 ms 21112 KB Output is correct
13 Correct 130 ms 28208 KB Output is correct
14 Correct 162 ms 19192 KB Output is correct
15 Correct 169 ms 21852 KB Output is correct
16 Correct 130 ms 28148 KB Output is correct
17 Correct 191 ms 16608 KB Output is correct
18 Correct 162 ms 22112 KB Output is correct

Subtask #3
0 / 45.0

# 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 12 ms 12032 KB Output is correct
4 Correct 15 ms 12416 KB Output is correct
5 Correct 16 ms 12228 KB Output is correct
6 Correct 16 ms 12544 KB Output is correct
7 Correct 24 ms 13568 KB Output is correct
8 Correct 14 ms 12468 KB Output is correct
9 Correct 82 ms 20704 KB Output is correct
10 Correct 20 ms 12160 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 89 ms 21112 KB Output is correct
13 Correct 140 ms 28120 KB Output is correct
14 Correct 158 ms 19148 KB Output is correct
15 Correct 167 ms 21936 KB Output is correct
16 Correct 144 ms 28148 KB Output is correct
17 Correct 184 ms 16632 KB Output is correct
18 Correct 154 ms 22136 KB Output is correct
19 Execution timed out 753 ms 92804 KB Time limit exceeded
20 Halted 0 ms 0 KB -