Submission #98419

# Submission time Handle Problem Language Result Execution time Memory
98419 2019-02-23T11:45:23 Z Kastanda Senior Postmen (BOI14_postmen) C++11
55 / 100
500 ms 58512 KB
#include<bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, m, cyc, from[N], to[N], M[N], S[N], ri[N];
vector < int > Adj[N];
void DFS(int v)
{
    S[v] = 1;
    #define id (Adj[v][ri[v]])
    #define u (from[id] ^ to[id] ^ v)
    while (ri[v])
    {
        ri[v] --;
        //int id = Adj[v][ri[v]];
        if (M[id]) continue;
        M[id] = 1;
        //int u = from[id] ^ to[id] ^ v;
        if (S[u])
        {
            cyc = u; S[v] = 0;
            printf("%d", v);
            return ;
        }
        DFS(u);
        if (cyc)
            printf(" %d", v);
        if (cyc != v)
        {
            S[v] = 0;
            return ;
        }
        else
            cyc = 0, printf("\n");
    }
    #undef id
    #undef u
    S[v] = 0;
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++)
    {
        scanf("%d%d", &from[i], &to[i]);
        Adj[from[i]].push_back(i);
        Adj[to[i]].push_back(i);
    }
    mt19937 Rnd(time(0) * 2394);
    for (int i = 1; i <= n; i++)
    {
        ri[i] = Adj[i].size();
        shuffle(Adj[i].begin(), Adj[i].end(), Rnd);
    }
    vector < int > P(n, 0);
    iota(P.begin(), P.end(), 1);
    shuffle(P.begin(), P.end(), Rnd);
    //for (int i = 1; i <= n; i++)
    for (int i : P)
        DFS(i);
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:41: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:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &from[i], &to[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 14 ms 12160 KB Output is correct
2 Correct 16 ms 12160 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 16 ms 12264 KB Output is correct
5 Correct 12 ms 12212 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 17 ms 12544 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 62 ms 14688 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 68 ms 14840 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 12116 KB Output is correct
2 Correct 11 ms 12136 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 14 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 18 ms 12160 KB Output is correct
7 Correct 21 ms 12544 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 63 ms 14588 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 72 ms 14844 KB Output is correct
13 Correct 113 ms 21344 KB Output is correct
14 Correct 107 ms 17136 KB Output is correct
15 Correct 108 ms 16892 KB Output is correct
16 Correct 115 ms 21244 KB Output is correct
17 Correct 112 ms 16936 KB Output is correct
18 Correct 102 ms 17836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 11 ms 12160 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 15 ms 12288 KB Output is correct
5 Correct 11 ms 12188 KB Output is correct
6 Correct 13 ms 12212 KB Output is correct
7 Correct 20 ms 12544 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 56 ms 14692 KB Output is correct
10 Correct 14 ms 12264 KB Output is correct
11 Correct 13 ms 12264 KB Output is correct
12 Correct 64 ms 14944 KB Output is correct
13 Correct 109 ms 21300 KB Output is correct
14 Correct 106 ms 17120 KB Output is correct
15 Correct 92 ms 16876 KB Output is correct
16 Correct 104 ms 21284 KB Output is correct
17 Correct 106 ms 17016 KB Output is correct
18 Correct 105 ms 17912 KB Output is correct
19 Execution timed out 701 ms 58512 KB Time limit exceeded
20 Halted 0 ms 0 KB -