Submission #129749

# Submission time Handle Problem Language Result Execution time Memory
129749 2019-07-13T07:15:15 Z SamAnd Senior Postmen (BOI14_postmen) C++17
0 / 100
500 ms 18856 KB
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
const int N = 500005;

int n, m;
vector<int> a[N];

set<pair<int, int> > s;
vector<int> v;
void dfs(int x)
{
    for (int i = 0; i < a[x].size(); ++i)
    {
        int h = a[x][i];
        if (s.find(m_p(x, h)) != s.end() || s.find(m_p(h, x)) != s.end())
            continue;
        s.insert(m_p(x, h));
        dfs(h);
    }
    v.push_back(x);
}

bool c[N];
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; ++i)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        a[x].push_back(y);
        a[y].push_back(x);
    }
    dfs(1);
    stack<int> s;
    for (int i = 0; i < v.size(); ++i)
    {
        if (c[v[i]])
        {
            printf("%d ", v[i]);
            while (s.top() != v[i])
            {
                printf("%d ", s.top());
                c[s.top()] = false;
                s.pop();
            }
            printf("\n");
        }
        else
        {
            s.push(v[i]);
            c[v[i]] = true;
        }
    }
    return 0;
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:13:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a[x].size(); ++i)
                     ~~^~~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:37:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); ++i)
                     ~~^~~~~~~~~~
postmen.cpp:27: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:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 268 ms 12540 KB Output is correct
5 Correct 18 ms 12288 KB Output is correct
6 Correct 63 ms 12696 KB Output is correct
7 Correct 420 ms 14304 KB Output is correct
8 Correct 14 ms 12416 KB Output is correct
9 Execution timed out 1087 ms 18820 KB Time limit exceeded
10 Halted 0 ms 0 KB -
# 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 13 ms 12032 KB Output is correct
4 Correct 259 ms 12536 KB Output is correct
5 Correct 20 ms 12160 KB Output is correct
6 Correct 69 ms 12664 KB Output is correct
7 Correct 411 ms 14456 KB Output is correct
8 Correct 14 ms 12416 KB Output is correct
9 Execution timed out 1091 ms 18816 KB Time limit exceeded
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 17 ms 12032 KB Output is correct
4 Correct 264 ms 12700 KB Output is correct
5 Correct 19 ms 12264 KB Output is correct
6 Correct 73 ms 12792 KB Output is correct
7 Correct 409 ms 14388 KB Output is correct
8 Correct 13 ms 12416 KB Output is correct
9 Execution timed out 1089 ms 18856 KB Time limit exceeded
10 Halted 0 ms 0 KB -