Submission #98418

# Submission time Handle Problem Language Result Execution time Memory
98418 2019-02-23T11:37:31 Z Kastanda Senior Postmen (BOI14_postmen) C++11
55 / 100
500 ms 56620 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);
    }
    for (int i = 1; i <= n; i++)
        ri[i] = Adj[i].size();
    for (int i = 1; i <= n; i++)
        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 13 ms 12160 KB Output is correct
2 Correct 13 ms 12136 KB Output is correct
3 Correct 13 ms 12160 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 35 ms 12544 KB Output is correct
8 Correct 12 ms 12416 KB Output is correct
9 Correct 52 ms 14584 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 63 ms 14944 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 12132 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 14 ms 12136 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 12288 KB Output is correct
7 Correct 17 ms 12544 KB Output is correct
8 Correct 13 ms 12320 KB Output is correct
9 Correct 51 ms 14608 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 62 ms 14840 KB Output is correct
13 Correct 93 ms 20880 KB Output is correct
14 Correct 125 ms 16904 KB Output is correct
15 Correct 90 ms 16624 KB Output is correct
16 Correct 97 ms 20856 KB Output is correct
17 Correct 99 ms 16632 KB Output is correct
18 Correct 97 ms 17528 KB Output is correct
# 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 12 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 14 ms 12160 KB Output is correct
7 Correct 18 ms 12564 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 55 ms 14692 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 54 ms 14840 KB Output is correct
13 Correct 109 ms 20856 KB Output is correct
14 Correct 98 ms 16760 KB Output is correct
15 Correct 95 ms 16588 KB Output is correct
16 Correct 104 ms 20960 KB Output is correct
17 Correct 116 ms 16652 KB Output is correct
18 Correct 93 ms 17532 KB Output is correct
19 Execution timed out 635 ms 56620 KB Time limit exceeded
20 Halted 0 ms 0 KB -