oj.uz

Submission #98421

# Submission time Handle Problem Language Result Execution time Memory
98421 2019-02-23T12:24:47 Z Kastanda Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 54592 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 + 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 12160 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 15 ms 12288 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 13 ms 12160 KB Output is correct
7 Correct 19 ms 12520 KB Output is correct
8 Correct 14 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 15 ms 12160 KB Output is correct
12 Correct 57 ms 14892 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 11 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 15 ms 12160 KB Output is correct
7 Correct 18 ms 12544 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 56 ms 14584 KB Output is correct
10 Correct 15 ms 12196 KB Output is correct
11 Correct 13 ms 12160 KB Output is correct
12 Correct 62 ms 14840 KB Output is correct
13 Correct 103 ms 20456 KB Output is correct
14 Correct 97 ms 16480 KB Output is correct
15 Correct 84 ms 16288 KB Output is correct
16 Correct 106 ms 20516 KB Output is correct
17 Correct 95 ms 16424 KB Output is correct
18 Correct 114 ms 17248 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12052 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 17 ms 12264 KB Output is correct
7 Correct 19 ms 12544 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 49 ms 14688 KB Output is correct
10 Correct 27 ms 12160 KB Output is correct
11 Correct 15 ms 12160 KB Output is correct
12 Correct 55 ms 14896 KB Output is correct
13 Correct 99 ms 20448 KB Output is correct
14 Correct 93 ms 16548 KB Output is correct
15 Correct 87 ms 16368 KB Output is correct
16 Correct 100 ms 20560 KB Output is correct
17 Correct 100 ms 16412 KB Output is correct
18 Correct 89 ms 17248 KB Output is correct
19 Execution timed out 638 ms 54592 KB Time limit exceeded
20 Halted 0 ms 0 KB -