oj.uz

답안 #907406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907406 2024-01-15T13:34:33 Z abcvuitunggio 수천개의 섬 (IOI22_islands) C++17
100 / 100
 144 ms 31880 KB 
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> u,v,ke[200001],ke2[200001],adj[200001],boring,res,ve;
int ch[200001],pos[200001],deg[200001],x,C;
void strain(){
    while (deg[x]==1){
        for (int i:ke[x]){
            int y=u[i]^v[i]^x;
            if (!ch[y]){
                boring.push_back(i);
                for (int i:ke2[x]){
                    int y=u[i]^v[i]^x;
                    if (!ch[y]&&!--deg[y])
                        ve.push_back(y);
                }
                C=0,ch[x]=1,x=y;
                break;
            }
        }
    }
}
void strain2(){
    while (!ve.empty()){
        C=0;
        int x=ve.back();
        ve.pop_back();
        ch[x]=1;
        for (int i:ke2[x]){
            int y=u[i]^v[i]^x;
            if (ch[y])
                continue;
            if (!--deg[y])
                ve.push_back(y);
        }
    }
}
pair <vector <int>, vector <int>> dfs(int s, int x){
    vector <int> ve,cycle;
    memset(pos,-1,sizeof(pos));
    ve.push_back(x);
    pos[x]=0;
    x=u[x]^v[x]^s;
    while (pos[adj[x][0]]==-1){
        int i=adj[x][0],y=u[i]^v[i]^x;
        x=y;
        pos[i]=ve.size();
        ve.push_back(i);
    }
    x=adj[x][0];
    for (int i=pos[x];i<ve.size();i++)
        cycle.push_back(ve[i]);
    while (ve.size()>pos[x])
        ve.pop_back();
    return {ve,cycle};
}
bool check(vector <int> a, vector <int> b){
    if (a.size()!=b.size())
        return false;
    memset(ch,0,sizeof(ch));
    for (int i:a)
        ch[i]=1;
    int cnt=0;
    for (int i:b)
        cnt+=ch[i];
    return (cnt==a.size());
}
vector <int> rev(vector <int> v){
    reverse(v.begin(),v.end());
    return v;
}
vector <int> operator +(vector <int> a, vector <int> b){
    for (int i:b)
        a.push_back(i);
    return a;
}
variant <bool, vector <int>> find_journey(int n, int m, vector <int> U, vector <int> V) {
    u=U,v=V;
    for (int i=0;i<m;i++){
        ke[u[i]].push_back(i);
        ke2[v[i]].push_back(i);
        deg[u[i]]++;
    }
    for (int i=0;i<n;i++)
        if (!deg[i])
            ve.push_back(i);
    while (!C){
        C=1;
        strain();
        strain2();
    }
    if (ch[x])
        return false;
    for (int i=0;i<n;i++)
        for (int j:ke[i])
            if (!ch[u[j]^v[j]^i])
                adj[i].push_back(j);
    auto [ve,c]=dfs(x,adj[x][0]);
    auto [ve2,c2]=dfs(x,adj[x][1]);
    res=boring+ve+c+rev(ve)+ve2;
    if (!check(c,c2))
        res=res+c2+rev(ve2)+ve+rev(ve+c)+ve2;
    return res+rev(boring+ve2+c2);
}

Compilation message

islands.cpp: In function 'std::pair<std::vector<int>, std::vector<int> > dfs(int, int)':
islands.cpp:51:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int i=pos[x];i<ve.size();i++)
      |                       ~^~~~~~~~~~
islands.cpp:53:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |     while (ve.size()>pos[x])
      |            ~~~~~~~~~^~~~~~~
islands.cpp: In function 'bool check(std::vector<int>, std::vector<int>)':
islands.cpp:66:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     return (cnt==a.size());
      |             ~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 15920 KB Output is correct
3 Correct 5 ms 16476 KB Output is correct
4 Correct 5 ms 16476 KB Output is correct
5 Correct 5 ms 14424 KB Output is correct
6 Correct 6 ms 15964 KB Output is correct
7 Correct 34 ms 23256 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 5 ms 14428 KB Output is correct
3 Correct 8 ms 15964 KB Output is correct
4 Correct 7 ms 15960 KB Output is correct
5 Correct 8 ms 15960 KB Output is correct
6 Correct 32 ms 22364 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16732 KB Output is correct
2 Correct 6 ms 14424 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 15960 KB Output is correct
5 Correct 7 ms 14680 KB Output is correct
6 Correct 7 ms 16216 KB Output is correct
7 Correct 5 ms 16984 KB Output is correct
8 Correct 6 ms 15964 KB Output is correct
9 Correct 7 ms 15964 KB Output is correct
10 Correct 8 ms 16220 KB Output is correct
11 Correct 6 ms 15964 KB Output is correct
12 Correct 8 ms 16220 KB Output is correct
13 Correct 5 ms 16476 KB Output is correct
14 Correct 5 ms 16476 KB Output is correct
15 Correct 6 ms 15964 KB Output is correct
16 Correct 5 ms 14424 KB Output is correct
17 Correct 29 ms 20072 KB Output is correct
18 Correct 27 ms 19548 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 7 ms 15960 KB Output is correct
21 Correct 7 ms 15964 KB Output is correct
22 Correct 6 ms 16216 KB Output is correct
23 Correct 45 ms 22308 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 16732 KB Output is correct
2 Correct 6 ms 16732 KB Output is correct
3 Correct 43 ms 22988 KB Output is correct
4 Correct 47 ms 23048 KB Output is correct
5 Correct 6 ms 16672 KB Output is correct
6 Correct 7 ms 16728 KB Output is correct
7 Correct 8 ms 16128 KB Output is correct
8 Correct 6 ms 15964 KB Output is correct
9 Correct 6 ms 15964 KB Output is correct
10 Correct 6 ms 16216 KB Output is correct
11 Correct 6 ms 16732 KB Output is correct
12 Correct 6 ms 16732 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 8 ms 16732 KB Output is correct
15 Correct 9 ms 16220 KB Output is correct
16 Correct 6 ms 16732 KB Output is correct
17 Correct 5 ms 16472 KB Output is correct
18 Correct 6 ms 16732 KB Output is correct
19 Correct 7 ms 16728 KB Output is correct
20 Correct 35 ms 23644 KB Output is correct
21 Correct 36 ms 23192 KB Output is correct
22 Correct 5 ms 16728 KB Output is correct
23 Correct 8 ms 16728 KB Output is correct
24 Correct 7 ms 16476 KB Output is correct
25 Correct 6 ms 16732 KB Output is correct
26 Correct 8 ms 16220 KB Output is correct
27 Correct 52 ms 23500 KB Output is correct
28 Correct 52 ms 23632 KB Output is correct
29 Correct 5 ms 16476 KB Output is correct
30 Correct 36 ms 24144 KB Output is correct
31 Correct 5 ms 15960 KB Output is correct
32 Correct 39 ms 23404 KB Output is correct
33 Correct 34 ms 23388 KB Output is correct
34 Correct 27 ms 19904 KB Output is correct
35 Correct 8 ms 15964 KB Output is correct
36 Correct 45 ms 22360 KB Output is correct
37 Correct 36 ms 24188 KB Output is correct
38 Correct 6 ms 16728 KB Output is correct
39 Correct 29 ms 22280 KB Output is correct
40 Correct 8 ms 16728 KB Output is correct
41 Correct 38 ms 24148 KB Output is correct
42 Correct 50 ms 23568 KB Output is correct
43 Correct 7 ms 16476 KB Output is correct
44 Correct 9 ms 16732 KB Output is correct
45 Correct 8 ms 16220 KB Output is correct
46 Correct 25 ms 19536 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 15920 KB Output is correct
3 Correct 5 ms 16476 KB Output is correct
4 Correct 5 ms 16476 KB Output is correct
5 Correct 5 ms 14424 KB Output is correct
6 Correct 6 ms 15964 KB Output is correct
7 Correct 34 ms 23256 KB Output is correct
8 Correct 7 ms 15960 KB Output is correct
9 Correct 5 ms 14428 KB Output is correct
10 Correct 8 ms 15964 KB Output is correct
11 Correct 7 ms 15960 KB Output is correct
12 Correct 8 ms 15960 KB Output is correct
13 Correct 32 ms 22364 KB Output is correct
14 Correct 9 ms 16732 KB Output is correct
15 Correct 6 ms 14424 KB Output is correct
16 Correct 6 ms 14428 KB Output is correct
17 Correct 7 ms 15960 KB Output is correct
18 Correct 7 ms 14680 KB Output is correct
19 Correct 7 ms 16216 KB Output is correct
20 Correct 5 ms 16984 KB Output is correct
21 Correct 6 ms 15964 KB Output is correct
22 Correct 7 ms 15964 KB Output is correct
23 Correct 8 ms 16220 KB Output is correct
24 Correct 6 ms 15964 KB Output is correct
25 Correct 8 ms 16220 KB Output is correct
26 Correct 5 ms 16476 KB Output is correct
27 Correct 5 ms 16476 KB Output is correct
28 Correct 6 ms 15964 KB Output is correct
29 Correct 5 ms 14424 KB Output is correct
30 Correct 29 ms 20072 KB Output is correct
31 Correct 27 ms 19548 KB Output is correct
32 Correct 8 ms 14428 KB Output is correct
33 Correct 7 ms 15960 KB Output is correct
34 Correct 7 ms 15964 KB Output is correct
35 Correct 6 ms 16216 KB Output is correct
36 Correct 45 ms 22308 KB Output is correct
37 Correct 7 ms 16216 KB Output is correct
38 Correct 5 ms 14428 KB Output is correct
39 Correct 7 ms 16476 KB Output is correct
40 Correct 7 ms 16732 KB Output is correct
41 Correct 23 ms 19804 KB Output is correct
42 Correct 7 ms 16732 KB Output is correct
43 Correct 34 ms 22476 KB Output is correct
44 Correct 38 ms 22484 KB Output is correct
45 Correct 50 ms 22324 KB Output is correct
46 Correct 7 ms 15964 KB Output is correct
47 Correct 6 ms 15960 KB Output is correct
48 Correct 8 ms 16100 KB Output is correct
49 Correct 8 ms 16216 KB Output is correct
50 Correct 126 ms 31092 KB Output is correct
51 Correct 109 ms 28160 KB Output is correct
52 Correct 113 ms 28104 KB Output is correct
53 Correct 94 ms 28116 KB Output is correct
54 Correct 72 ms 28104 KB Output is correct
55 Correct 71 ms 28104 KB Output is correct
56 Correct 144 ms 28080 KB Output is correct
57 Correct 66 ms 28612 KB Output is correct
58 Correct 89 ms 30980 KB Output is correct
59 Correct 76 ms 27480 KB Output is correct
60 Correct 85 ms 26704 KB Output is correct
61 Correct 86 ms 26724 KB Output is correct
62 Correct 20 ms 19032 KB Output is correct
63 Correct 80 ms 26644 KB Output is correct
64 Correct 34 ms 20312 KB Output is correct
65 Correct 7 ms 16472 KB Output is correct
66 Correct 7 ms 16732 KB Output is correct
67 Correct 85 ms 29760 KB Output is correct
68 Correct 38 ms 24164 KB Output is correct
69 Correct 45 ms 23644 KB Output is correct
70 Correct 7 ms 16216 KB Output is correct
71 Correct 61 ms 23880 KB Output is correct
72 Correct 6 ms 15960 KB Output is correct
73 Correct 72 ms 26208 KB Output is correct
74 Correct 109 ms 31880 KB Output is correct
75 Correct 8 ms 16988 KB Output is correct
76 Correct 40 ms 23356 KB Output is correct
77 Correct 57 ms 26064 KB Output is correct
78 Correct 72 ms 26748 KB Output is correct
79 Correct 5 ms 16472 KB Output is correct
80 Correct 108 ms 31068 KB Output is correct
81 Correct 6 ms 15644 KB Output is correct
82 Correct 42 ms 23360 KB Output is correct
83 Correct 6 ms 15452 KB Output is correct
84 Correct 5 ms 16472 KB Output is correct
85 Correct 40 ms 23224 KB Output is correct
86 Correct 6 ms 16732 KB Output is correct
87 Correct 8 ms 17624 KB Output is correct
88 Correct 7 ms 16952 KB Output is correct
89 Correct 71 ms 26712 KB Output is correct
90 Correct 71 ms 26708 KB Output is correct
91 Correct 99 ms 30908 KB Output is correct
92 Correct 5 ms 15452 KB Output is correct