Submission #98423

# Submission time Handle Problem Language Result Execution time Memory
98423 2019-02-23T12:26:42 Z Kastanda Senior Postmen (BOI14_postmen) C++11
55 / 100
500 ms 62464 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;
            cout << v;
            return ;
        }
        DFS(u);
        if (cyc)
            cout << ' ' << v;
        if (cyc != v)
        {
            S[v] = 0;
            return ;
        }
        else
            cyc = 0, cout << '\n';
    }
    S[v] = 0;
}
int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
    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:42: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:45: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 17 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 13 ms 12320 KB Output is correct
5 Correct 11 ms 12136 KB Output is correct
6 Correct 18 ms 12288 KB Output is correct
7 Correct 19 ms 12544 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 52 ms 14688 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 62 ms 14884 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 18 ms 12288 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 16 ms 12288 KB Output is correct
7 Correct 20 ms 12544 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 48 ms 14584 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 53 ms 14840 KB Output is correct
13 Correct 97 ms 22068 KB Output is correct
14 Correct 89 ms 16504 KB Output is correct
15 Correct 80 ms 16384 KB Output is correct
16 Correct 101 ms 22092 KB Output is correct
17 Correct 103 ms 16460 KB Output is correct
18 Correct 91 ms 17632 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 16 ms 12160 KB Output is correct
3 Correct 12 ms 12084 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 12 ms 12136 KB Output is correct
6 Correct 16 ms 12288 KB Output is correct
7 Correct 22 ms 12544 KB Output is correct
8 Correct 16 ms 12288 KB Output is correct
9 Correct 53 ms 14712 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 57 ms 14944 KB Output is correct
13 Correct 102 ms 22276 KB Output is correct
14 Correct 89 ms 16504 KB Output is correct
15 Correct 75 ms 16368 KB Output is correct
16 Correct 98 ms 22136 KB Output is correct
17 Correct 96 ms 16352 KB Output is correct
18 Correct 118 ms 17728 KB Output is correct
19 Execution timed out 698 ms 62464 KB Time limit exceeded
20 Halted 0 ms 0 KB -