oj.uz

Submission #98422

# Submission time Handle Problem Language Result Execution time Memory
98422 2019-02-23T12:25:17 Z Kastanda Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 54684 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, m, cyc, from[N], to[N], M[N], S[N];
int cnt = 0;
vector < int > Adj[N];
void DFS(int v)
{
    cnt ++;
    assert(cnt <= m + n);
    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++)
        if (Adj[i].size())
            DFS(i);
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:40: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:43: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 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 13 ms 12140 KB Output is correct
4 Correct 18 ms 12336 KB Output is correct
5 Correct 16 ms 12160 KB Output is correct
6 Correct 16 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 53 ms 14660 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 58 ms 14860 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 13 ms 12212 KB Output is correct
3 Correct 13 ms 12032 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 12288 KB Output is correct
7 Correct 17 ms 12544 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 52 ms 14644 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 14 ms 12264 KB Output is correct
12 Correct 63 ms 14800 KB Output is correct
13 Correct 101 ms 20576 KB Output is correct
14 Correct 85 ms 16688 KB Output is correct
15 Correct 82 ms 16296 KB Output is correct
16 Correct 98 ms 20472 KB Output is correct
17 Correct 106 ms 16408 KB Output is correct
18 Correct 105 ms 17272 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12288 KB Output is correct
7 Correct 18 ms 12544 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 59 ms 14688 KB Output is correct
10 Correct 17 ms 12212 KB Output is correct
11 Correct 15 ms 12264 KB Output is correct
12 Correct 62 ms 14920 KB Output is correct
13 Correct 106 ms 20472 KB Output is correct
14 Correct 94 ms 16552 KB Output is correct
15 Correct 82 ms 16368 KB Output is correct
16 Correct 105 ms 20512 KB Output is correct
17 Correct 124 ms 16560 KB Output is correct
18 Correct 97 ms 17252 KB Output is correct
19 Execution timed out 645 ms 54684 KB Time limit exceeded
20 Halted 0 ms 0 KB -