oj.uz

Submission #635915

# Submission time Handle Problem Language Result Execution time Memory
635915 2022-08-27T11:21:30 Z AA_Surely Senior Postmen (BOI14_postmen) C++17
100 / 100
 417 ms 88252 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define FOR(i, x, n) for(int i = x; i < n; i++)
#define F0R(i, n) FOR(i, 0, n)
#define ROF(i, x, n) for(int i = n - 1; i >= x; i--)
#define R0F(i, n) ROF(i, 0, n)

#define WTF cout << "WTF" << endl

#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define PB push_back
#define EP emplace_back

#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()

using namespace std;

typedef long long LL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;

const int N = 5e5 + 7;

int n, m, ptr;
bool vis[N], seen[N];
int cnt[N];
VPII adj[N];
VI ans[N];

struct Tour {
    bool vis[N];
    VI ord;

    void add(int x) {
        if (vis[x]) {
            int now = ord.back();
            while(now != x) {
                ans[ptr].PB(now);
                vis[now] = 0;
                ord.pop_back();
                now = ord.back();
            }

            ans[ptr].PB(now);
            vis[now] = 0;
            ord.pop_back();

            ptr++;
        }

        vis[x] = 1;
        ord.PB(x);
        return;
    }
} etds;

void init() {
    cin >> n >> m;
    F0R(i, m) {
        int u, v; 
        cin >> u >> v;
        adj[--u].PB({--v, i});
        adj[v].PB({u, i});
    }

    return;
}

void dfs(int now) {
    vis[now] = 1;
    //cout << "now on : " << now + 1 << endl;

    while(cnt[now] < adj[now].size()) {
        cnt[now]++;
        if (!seen[adj[now][ cnt[now] - 1 ].S]) {
            seen[adj[now][ cnt[now] - 1 ].S] = 1;
            dfs(adj[now][ cnt[now] - 1 ].F);
        }
    }

    etds.add(now);
    return;
}

int main() {
    IOS;

    init();
    F0R(i, n) if (!vis[i]) dfs(i);
    
    F0R(i, ptr) {
        for(int on : ans[i]) cout << on + 1 << ' '; 
        cout << '\n';
    }

    return 0;
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:83:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     while(cnt[now] < adj[now].size()) {
      |           ~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 14 ms 24076 KB Output is correct
5 Correct 12 ms 23892 KB Output is correct
6 Correct 13 ms 24276 KB Output is correct
7 Correct 19 ms 25444 KB Output is correct
8 Correct 16 ms 23952 KB Output is correct
9 Correct 52 ms 33656 KB Output is correct
10 Correct 14 ms 24020 KB Output is correct
11 Correct 13 ms 24052 KB Output is correct
12 Correct 45 ms 34100 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23828 KB Output is correct
2 Correct 15 ms 23820 KB Output is correct
3 Correct 12 ms 23748 KB Output is correct
4 Correct 14 ms 24084 KB Output is correct
5 Correct 13 ms 23820 KB Output is correct
6 Correct 17 ms 24268 KB Output is correct
7 Correct 17 ms 25428 KB Output is correct
8 Correct 16 ms 24116 KB Output is correct
9 Correct 44 ms 33668 KB Output is correct
10 Correct 14 ms 24020 KB Output is correct
11 Correct 14 ms 24072 KB Output is correct
12 Correct 45 ms 34060 KB Output is correct
13 Correct 59 ms 36508 KB Output is correct
14 Correct 60 ms 32968 KB Output is correct
15 Correct 68 ms 35560 KB Output is correct
16 Correct 60 ms 36552 KB Output is correct
17 Correct 62 ms 30432 KB Output is correct
18 Correct 69 ms 34608 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23816 KB Output is correct
3 Correct 13 ms 23820 KB Output is correct
4 Correct 14 ms 24140 KB Output is correct
5 Correct 12 ms 23892 KB Output is correct
6 Correct 14 ms 24208 KB Output is correct
7 Correct 17 ms 25360 KB Output is correct
8 Correct 13 ms 24020 KB Output is correct
9 Correct 45 ms 33648 KB Output is correct
10 Correct 14 ms 23956 KB Output is correct
11 Correct 15 ms 23984 KB Output is correct
12 Correct 45 ms 34060 KB Output is correct
13 Correct 62 ms 36484 KB Output is correct
14 Correct 63 ms 32864 KB Output is correct
15 Correct 59 ms 35500 KB Output is correct
16 Correct 85 ms 36540 KB Output is correct
17 Correct 61 ms 30476 KB Output is correct
18 Correct 73 ms 34596 KB Output is correct
19 Correct 397 ms 88236 KB Output is correct
20 Correct 369 ms 70716 KB Output is correct
21 Correct 378 ms 83484 KB Output is correct
22 Correct 405 ms 88252 KB Output is correct
23 Correct 164 ms 72312 KB Output is correct
24 Correct 417 ms 57672 KB Output is correct
25 Correct 405 ms 78528 KB Output is correct