oj.uz

Submission #31396

# Submission time Handle Problem Language Result Execution time Memory
31396 2017-08-20T22:03:11 Z imaxblue Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 100692 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()){
            cout << 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(){
    cin >> n >> m;
    //scanf("%i%i", &n, &m);
    fox(l, m){
        cin >> a >> b;
        //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]){
           ~~~~^~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 19 ms 12416 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 21 ms 12544 KB Output is correct
7 Correct 28 ms 13696 KB Output is correct
8 Correct 18 ms 12416 KB Output is correct
9 Correct 133 ms 22240 KB Output is correct
10 Correct 19 ms 12288 KB Output is correct
11 Correct 20 ms 12416 KB Output is correct
12 Correct 140 ms 22700 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12084 KB Output is correct
2 Correct 13 ms 12080 KB Output is correct
3 Correct 14 ms 12032 KB Output is correct
4 Correct 17 ms 12416 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 17 ms 12544 KB Output is correct
7 Correct 31 ms 13688 KB Output is correct
8 Correct 16 ms 12368 KB Output is correct
9 Correct 123 ms 22368 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 21 ms 12416 KB Output is correct
12 Correct 145 ms 22668 KB Output is correct
13 Correct 200 ms 29780 KB Output is correct
14 Correct 223 ms 19936 KB Output is correct
15 Correct 208 ms 23504 KB Output is correct
16 Correct 208 ms 29684 KB Output is correct
17 Correct 273 ms 16816 KB Output is correct
18 Correct 235 ms 23268 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 13 ms 12092 KB Output is correct
4 Correct 19 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 17 ms 12544 KB Output is correct
7 Correct 44 ms 13748 KB Output is correct
8 Correct 19 ms 12416 KB Output is correct
9 Correct 119 ms 22256 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 20 ms 12416 KB Output is correct
12 Correct 139 ms 22672 KB Output is correct
13 Correct 203 ms 29736 KB Output is correct
14 Correct 224 ms 19924 KB Output is correct
15 Correct 209 ms 23504 KB Output is correct
16 Correct 196 ms 29812 KB Output is correct
17 Correct 233 ms 16736 KB Output is correct
18 Correct 239 ms 23316 KB Output is correct
19 Execution timed out 1073 ms 100692 KB Time limit exceeded
20 Halted 0 ms 0 KB -