oj.uz

답안 #907227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907227 2024-01-15T09:46:59 Z abcvuitunggio 수천개의 섬 (IOI22_islands) C++17
19.25 / 100
 47 ms 38996 KB 
#include "islands.h"
#include <variant>
#include <vector>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
vector <int> u,v,ke[100001],ke2[100001],adj[100001],boring,fun,res,ve;
int n,m,ch[200001],pos[200001],vis[200001],last[200001],deg[100001];
pair <vector <int>, vector <int>> dfs(int s, int x){
    vector <int> ve,cycle;
    memset(pos,-1,sizeof(pos));
    ve.push_back(x);
    x=u[x]^v[x]^s;
    while (pos[x]==-1){
        pos[x]=ve.size();
        int i=adj[x][0];
        int y=u[i]^v[i]^x;
        x=y;
        ve.push_back(i);
    }
    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){
    memset(ch,0,sizeof(ch));
    for (int i:a)
        ch[i]=1;
    for (int i:b)
        if (ch[i])
            return true;
    return false;
}
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) {
    n=N,m=M,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]){
            ch[i]=1;
            ve.push_back(i);
        }
    while (!ve.empty()){
        int x=ve.back();
        ve.pop_back();
        ch[x]=1;
        for (int i:ke2[x]){
            int y=u[i]^v[i]^x;
            if (!--deg[y])
                ve.push_back(y);
        }
    }
    if (ch[0])
        return false;
    int x=0;
    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])
                    deg[u[i]^v[i]^x]--;
                ch[x]=1;
                x=y;
                break;
            }
        }
    }
    if (!deg[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]);
    if (check(c,c2))
        fun=ve+c+rev(ve)+ve2+rev(c2)+rev(ve2);
    else
        fun=ve+c+rev(ve)+ve2+c2+rev(ve2)+ve+rev(c)+rev(ve)+ve2+rev(c2)+rev(ve2);
    return boring+fun+rev(boring);
}

Compilation message

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

Subtask #1
1.75 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Partially correct 4 ms 10844 KB Output is partially correct
3 Correct 3 ms 8776 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Partially correct 2 ms 10844 KB Output is partially correct
7 Partially correct 33 ms 18792 KB Output is partially correct

Subtask #2
1.75 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10844 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Partially correct 3 ms 10844 KB Output is partially correct
4 Partially correct 3 ms 10844 KB Output is partially correct
5 Partially correct 2 ms 10844 KB Output is partially correct
6 Partially correct 29 ms 18260 KB Output is partially correct

Subtask #3
7.35 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 4 ms 10844 KB Output is partially correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Partially correct 3 ms 10844 KB Output is partially correct
5 Correct 2 ms 8796 KB Output is correct
6 Partially correct 3 ms 10844 KB Output is partially correct
7 Correct 3 ms 8796 KB Output is correct
8 Partially correct 2 ms 10844 KB Output is partially correct
9 Partially correct 2 ms 10844 KB Output is partially correct
10 Partially correct 3 ms 11096 KB Output is partially correct
11 Partially correct 2 ms 10844 KB Output is partially correct
12 Partially correct 3 ms 10844 KB Output is partially correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Partially correct 3 ms 10844 KB Output is partially correct
16 Correct 3 ms 8792 KB Output is correct
17 Partially correct 20 ms 15464 KB Output is partially correct
18 Correct 19 ms 14940 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Partially correct 2 ms 10844 KB Output is partially correct
21 Partially correct 3 ms 10844 KB Output is partially correct
22 Partially correct 3 ms 10844 KB Output is partially correct
23 Partially correct 28 ms 18340 KB Output is partially correct

Subtask #4
8.4 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 3 ms 10844 KB Output is partially correct
2 Correct 4 ms 10844 KB Output is correct
3 Correct 30 ms 18004 KB Output is correct
4 Partially correct 31 ms 18648 KB Output is partially correct
5 Partially correct 4 ms 10844 KB Output is partially correct
6 Partially correct 3 ms 10848 KB Output is partially correct
7 Partially correct 2 ms 10844 KB Output is partially correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 4 ms 11100 KB Output is correct
11 Correct 3 ms 8796 KB Output is correct
12 Correct 4 ms 10844 KB Output is correct
13 Partially correct 4 ms 11100 KB Output is partially correct
14 Partially correct 3 ms 10844 KB Output is partially correct
15 Correct 4 ms 11100 KB Output is correct
16 Correct 4 ms 10844 KB Output is correct
17 Correct 3 ms 9048 KB Output is correct
18 Correct 4 ms 10844 KB Output is correct
19 Correct 3 ms 10844 KB Output is correct
20 Correct 31 ms 16988 KB Output is correct
21 Partially correct 30 ms 18516 KB Output is partially correct
22 Correct 3 ms 8796 KB Output is correct
23 Correct 3 ms 8796 KB Output is correct
24 Correct 2 ms 9048 KB Output is correct
25 Correct 3 ms 10844 KB Output is correct
26 Correct 4 ms 10856 KB Output is correct
27 Partially correct 33 ms 18896 KB Output is partially correct
28 Correct 32 ms 19036 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 34 ms 17748 KB Output is correct
31 Correct 3 ms 10836 KB Output is correct
32 Correct 35 ms 18772 KB Output is correct
33 Correct 30 ms 18328 KB Output is correct
34 Correct 20 ms 15444 KB Output is correct
35 Correct 3 ms 10844 KB Output is correct
36 Correct 28 ms 17840 KB Output is correct
37 Correct 33 ms 19612 KB Output is correct
38 Correct 3 ms 8796 KB Output is correct
39 Correct 27 ms 15508 KB Output is correct
40 Correct 3 ms 10844 KB Output is correct
41 Correct 33 ms 17648 KB Output is correct
42 Correct 33 ms 19028 KB Output is correct
43 Correct 2 ms 8796 KB Output is correct
44 Correct 3 ms 8796 KB Output is correct
45 Correct 4 ms 10844 KB Output is correct
46 Correct 18 ms 14684 KB Output is correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Partially correct 4 ms 10844 KB Output is partially correct
3 Correct 3 ms 8776 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Partially correct 2 ms 10844 KB Output is partially correct
7 Partially correct 33 ms 18792 KB Output is partially correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Partially correct 3 ms 10844 KB Output is partially correct
11 Partially correct 3 ms 10844 KB Output is partially correct
12 Partially correct 2 ms 10844 KB Output is partially correct
13 Partially correct 29 ms 18260 KB Output is partially correct
14 Partially correct 4 ms 10844 KB Output is partially correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Partially correct 3 ms 10844 KB Output is partially correct
18 Correct 2 ms 8796 KB Output is correct
19 Partially correct 3 ms 10844 KB Output is partially correct
20 Correct 3 ms 8796 KB Output is correct
21 Partially correct 2 ms 10844 KB Output is partially correct
22 Partially correct 2 ms 10844 KB Output is partially correct
23 Partially correct 3 ms 11096 KB Output is partially correct
24 Partially correct 2 ms 10844 KB Output is partially correct
25 Partially correct 3 ms 10844 KB Output is partially correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Partially correct 3 ms 10844 KB Output is partially correct
29 Correct 3 ms 8792 KB Output is correct
30 Partially correct 20 ms 15464 KB Output is partially correct
31 Correct 19 ms 14940 KB Output is correct
32 Correct 2 ms 8796 KB Output is correct
33 Partially correct 2 ms 10844 KB Output is partially correct
34 Partially correct 3 ms 10844 KB Output is partially correct
35 Partially correct 3 ms 10844 KB Output is partially correct
36 Partially correct 28 ms 18340 KB Output is partially correct
37 Correct 4 ms 10844 KB Output is correct
38 Correct 2 ms 8796 KB Output is correct
39 Correct 2 ms 8796 KB Output is correct
40 Correct 2 ms 8796 KB Output is correct
41 Correct 17 ms 12380 KB Output is correct
42 Correct 3 ms 8796 KB Output is correct
43 Runtime error 47 ms 38996 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -