oj.uz

답안 #630939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630939 2022-08-17T11:03:34 Z garam1732 수천개의 섬 (IOI22_islands) C++17
24 / 100
 110 ms 12552 KB 
#include "islands.h"

#include <iostream>
#include <variant>
#include <vector>
#include <algorithm>
#include <map>
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pi;

map<pi, int> m;
vector<pi> adj[100100];
vector<pi> v;
vector<int> ans;
bool visited[100100], chk[100100];
int x = -1;

void dfs(int here) {
    //cout << here << endl;
    for(pi there : adj[here]) {
        if(visited[there.ff]) {
            v.push_back(there);
            x = there.ff;
            return;
        }
        if(chk[there.ff]) continue;

        visited[there.ff] = true;
        chk[there.ff] = true;
        v.push_back(there);
        dfs(there.ff);
        if(x != -1) return;
        visited[there.ff] = false;
        v.pop_back();
    }
}

vector<int> em;
//vector<int> find_journey(
std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
    for(int i = 0; i < M; i+=2) {
        if(m.find(pi(U[i], V[i])) == m.end()) {
        adj[U[i]].push_back(pi(V[i], i));
        }
        //adj[V[i]].push_back(pi(U[i], i));
        m[pi(U[i], V[i])] = 1;
    }

    visited[0] = chk[0] = true;
    dfs(0);

    if(x == -1) return false;

    int i;
    for(i = 0; i < v.size(); i++) if(v[i].ff == x) break;

    if(i == (int)v.size()-1) i = -1;
    for(int j = 0; j <= i; j++) ans.push_back(v[j].ss);
    for(int j = i+1; j < v.size(); j++) ans.push_back(v[j].ss);
    for(int j = i+1; j < v.size(); j++) ans.push_back(v[j].ss^1);
    for(int j = (int)v.size()-1; j > i; j--) ans.push_back(v[j].ss);
    for(int j = (int)v.size()-1; j > i; j--) ans.push_back(v[j].ss^1);
    for(int j = i; j >= 0; j--) ans.push_back(v[j].ss);
    return ans;

//    std::vector<int> v, w;
//    for(int i = 0; i < M; i++) {
//        if(U[i] == 0) v.push_back(i);
//        else w.push_back(i);
//    }
//
//    if(v.size() < 2 || w.size() < 1) {
//        return em;
//        //return false;
//    }
//    std::vector<int> ans;
//    ans.push_back(v[0]);
//    ans.push_back(w[0]);
//    ans.push_back(v[1]);
//    ans.push_back(v[0]);
//    ans.push_back(w[0]);
//    ans.push_back(v[1]);
//    return ans;
}

Compilation message

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:58:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(i = 0; i < v.size(); i++) if(v[i].ff == x) break;
      |                ~~^~~~~~~~~~
islands.cpp:62:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int j = i+1; j < v.size(); j++) ans.push_back(v[j].ss);
      |                      ~~^~~~~~~~~~
islands.cpp:63:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(int j = i+1; j < v.size(); j++) ans.push_back(v[j].ss^1);
      |                      ~~^~~~~~~~~~

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 4 ms 2772 KB Output is partially correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2548 KB Output is correct
4 Partially correct 2 ms 2644 KB Output is partially correct
5 Correct 3 ms 2772 KB Output is correct
6 Partially correct 2 ms 2644 KB Output is partially correct
7 Correct 3 ms 2644 KB Output is correct
8 Incorrect 2 ms 2644 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 49 ms 5744 KB Output is correct
4 Correct 82 ms 10464 KB Output is correct
5 Correct 4 ms 2772 KB Output is correct
6 Correct 4 ms 2772 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 3 ms 2900 KB Output is correct
12 Correct 4 ms 2900 KB Output is correct
13 Correct 4 ms 2928 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 4 ms 2900 KB Output is correct
16 Correct 2 ms 2792 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 57 ms 6032 KB Output is correct
21 Correct 84 ms 11432 KB Output is correct
22 Correct 3 ms 2808 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2672 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 3 ms 2900 KB Output is correct
27 Correct 77 ms 9516 KB Output is correct
28 Correct 73 ms 10188 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 110 ms 12552 KB Output is correct
31 Correct 2 ms 2648 KB Output is correct
32 Correct 78 ms 10580 KB Output is correct
33 Correct 59 ms 6008 KB Output is correct
34 Correct 44 ms 7852 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 64 ms 9808 KB Output is correct
37 Correct 103 ms 12020 KB Output is correct
38 Correct 3 ms 2772 KB Output is correct
39 Correct 62 ms 9272 KB Output is correct
40 Correct 2 ms 2772 KB Output is correct
41 Correct 96 ms 12532 KB Output is correct
42 Correct 97 ms 10412 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 4 ms 2772 KB Output is correct
45 Correct 3 ms 2900 KB Output is correct
46 Correct 32 ms 6884 KB Output is correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -