oj.uz

Submission #98417

# Submission time Handle Problem Language Result Execution time Memory
98417 2019-02-23T11:33:48 Z Kastanda Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 54648 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, m, cyc, from[N], to[N], M[N], S[N];
vector < int > Adj[N];
void DFS(int v)
{
    S[v] = 1;
    while (Adj[v].size())
    {
        int id = Adj[v].back();
        Adj[v].pop_back();
        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");
    }
    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++)
        DFS(i);
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:37: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:40: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]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12136 KB Output is correct
2 Correct 13 ms 12136 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 12 ms 12160 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 16 ms 12544 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 51 ms 14584 KB Output is correct
10 Correct 15 ms 12160 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 55 ms 14840 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 13 ms 12160 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 14 ms 12288 KB Output is correct
7 Correct 27 ms 12536 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 49 ms 14676 KB Output is correct
10 Correct 18 ms 12264 KB Output is correct
11 Correct 21 ms 12288 KB Output is correct
12 Correct 56 ms 14816 KB Output is correct
13 Correct 94 ms 20468 KB Output is correct
14 Correct 91 ms 16480 KB Output is correct
15 Correct 83 ms 16368 KB Output is correct
16 Correct 96 ms 20508 KB Output is correct
17 Correct 100 ms 16376 KB Output is correct
18 Correct 107 ms 17292 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 17 ms 12160 KB Output is correct
7 Correct 17 ms 12544 KB Output is correct
8 Correct 16 ms 12288 KB Output is correct
9 Correct 54 ms 14584 KB Output is correct
10 Correct 16 ms 12212 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 65 ms 14840 KB Output is correct
13 Correct 98 ms 20472 KB Output is correct
14 Correct 85 ms 16504 KB Output is correct
15 Correct 85 ms 16344 KB Output is correct
16 Correct 93 ms 20476 KB Output is correct
17 Correct 97 ms 16356 KB Output is correct
18 Correct 95 ms 17400 KB Output is correct
19 Execution timed out 638 ms 54648 KB Time limit exceeded
20 Halted 0 ms 0 KB -