oj.uz

답안 #767290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767290 2023-06-26T15:07:43 Z t6twotwo 수천개의 섬 (IOI22_islands) C++17
55 / 100
 33 ms 6108 KB 
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    if (N == 2) {
        vector<int> a, b;
        for (int i = 0; i < M; i++) {
            if (U[i] == 0) {
                a.push_back(i);
            } else {
                b.push_back(i);
            }
        }
        if (a.size() >= 2 && b.size() >= 1) {
            return vector{a[0], b[0], a[1], a[0], b[0], a[1]};
        } else {
            return false;
        }
    }
    bool subtask3 = 0;
    bool subtask4 = 0;
    if (M % 2 == 0) {
        subtask3 = 1;
        subtask4 = 1;
        for (int i = 0; i < M; i += 2) {
            if (U[i] != V[i + 1] || V[i] != U[i + 1]) {
                subtask3 = 0;
            }
            if (U[i] != U[i + 1] || V[i] != V[i + 1]) {
                subtask4 = 0;
            }
        }
    }
    vector<vector<pair<int, int>>> adj(N);
    for (int i = 0; i < M; i++) {
        adj[U[i]].emplace_back(V[i], i);
    }
    if (subtask3) {
        vector<int> ans;
        int x = 0, p = -1;
        while (1) {
            vector<array<int, 2>> f;
            for (auto [y, z] : adj[x]) {
                if (y != p) {
                    f.push_back({y, z});
                }
            }
            if (f.empty()) {
                return false;
            }
            if (f.size() == 1) {
                ans.push_back(f[0][1]);
                p = x;
                x = f[0][0];
                continue;
            }
            auto v = vector(ans.rbegin(), ans.rend());
            vector<int> s(M);
            ans.push_back(f[0][1]);
            ans.push_back(f[0][1] ^ 1);
            ans.push_back(f[1][1]);
            ans.push_back(f[1][1] ^ 1);
            ans.push_back(f[0][1] ^ 1);
            ans.push_back(f[0][1]);
            ans.push_back(f[1][1] ^ 1);
            ans.push_back(f[1][1]);
            ans.insert(ans.end(), v.begin(), v.end());
            return ans;
        }
    }
    if (subtask4) {
        vector<int> p, ans, vis(N);
        auto dfs = [&](auto dfs, int x) -> bool {
            vis[x] = 1;
            for (auto [y, z] : adj[x]) {
                if (vis[y] == 1) {
                    p.push_back(z);
                    int t = 0, q = 0;
                    while (t != y) {
                        t ^= U[p[q]] ^ V[p[q]];
                        q++;
                    }
                    for (int i = 0; i < q; i++) {
                        ans.push_back(p[i]);
                    }
                    for (int i = q; i < p.size(); i++) {
                        ans.push_back(p[i]);
                    }
                    for (int i = q; i < p.size(); i++) {
                        ans.push_back(p[i] ^ 1);
                    }
                    for (int i = p.size() - 1; i >= q; i--) {
                        ans.push_back(p[i]);
                    }
                    for (int i = p.size() - 1; i >= q; i--) {
                        ans.push_back(p[i] ^ 1);
                    }
                    for (int i = q - 1; i >= 0; i--) {
                        ans.push_back(p[i]);
                    }
                    return 1;
                }
                if (!vis[y]) {
                    p.push_back(z);
                    if (dfs(dfs, y)) {
                        return 1;
                    }
                    p.pop_back();
                }
            }
            vis[x] = 2;
            return 0;
        };
        if (dfs(dfs, 0)) {
            return ans;
        } else {
            return false;
        }
    }
    int s[3][3];
    for (int i = 0; i < M; i++) {
        if (U[i] < 3 && V[i] < 3) {
            s[U[i]][V[i]] = i;
        }
    }
    return vector{s[0][1], s[1][2], s[2][0], s[0][2], s[2][1], s[1][0], s[2][0], s[1][2], s[0][1], s[1][0], s[2][1], s[0][2]};
}

Compilation message

islands.cpp: In instantiation of 'find_journey(int, int, std::vector<int>, std::vector<int>)::<lambda(auto:23, int)> [with auto:23 = find_journey(int, int, std::vector<int>, std::vector<int>)::<lambda(auto:23, int)>]':
islands.cpp:114:23:   required from here
islands.cpp:86:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |                     for (int i = q; i < p.size(); i++) {
      |                                     ~~^~~~~~~~~~
islands.cpp:89:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |                     for (int i = q; i < p.size(); i++) {
      |                                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 25 ms 4428 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 23 ms 5204 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 14 ms 3432 KB Output is correct
18 Correct 11 ms 3028 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 24 ms 5276 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 23 ms 4920 KB Output is correct
4 Correct 25 ms 5196 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 26 ms 5580 KB Output is correct
21 Correct 24 ms 5180 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 27 ms 5716 KB Output is correct
28 Correct 26 ms 5752 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 27 ms 6100 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 24 ms 5680 KB Output is correct
33 Correct 25 ms 5372 KB Output is correct
34 Correct 14 ms 3028 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 22 ms 4756 KB Output is correct
37 Correct 26 ms 5900 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 21 ms 4724 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 27 ms 6108 KB Output is correct
42 Correct 33 ms 5748 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 11 ms 2600 KB Output is correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 25 ms 4428 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 23 ms 5204 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 14 ms 3432 KB Output is correct
31 Correct 11 ms 3028 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 24 ms 5276 KB Output is correct
37 Partially correct 0 ms 212 KB Output is partially correct
38 Correct 0 ms 212 KB Output is correct
39 Incorrect 1 ms 212 KB Output isn't correct
40 Halted 0 ms 0 KB -