oj.uz

답안 #1060970

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060970 2024-08-16T05:06:59 Z onbert Simurgh (IOI17_simurgh) C++17
30 / 100
 85 ms 3660 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
vector<pair<int,int>> adj[maxn];
int vis[maxn], cnt;

vector<int> used;

void dfs(int u) {
    vis[u] = cnt;
    for (auto [v, id]:adj[u]) if (!vis[v]) {
        used.push_back(id);
        dfs(v);
    }
}

vector<int> find_roads(int n, vector<int> U, vector<int> V) {
    for (int i=0;i<U.size();i++) {
        adj[U[i]].push_back({V[i], i}), adj[V[i]].push_back({U[i], i});
    }
    vector<int> golden;
    for (int i=0;i<n;i++) {
        for (int j=0;j<n;j++) vis[j] = 0;
        vis[i] = -1;
        cnt = 0;
        used.clear();
        vector<vector<int>> vec = {{}};
        for (auto [v, id]:adj[i]) {
            if (vis[v]) vec[vis[v]].push_back(id);
            else {
                cnt++, vec.push_back({id});
                dfs(v);
            }
        }
        int ans[U.size()];
        for (int i=0;i<U.size();i++) ans[i] = -1;
        for (int j=1;j<=cnt;j++) {
            vector<int> thing = used;
            for (int k=1;k<=cnt;k++) if (j!=k) thing.push_back(vec[k][0]);
            vector<pair<int,int>> ret;
            int mx = -1;
            for (int v:vec[j]) {
                thing.push_back(v);
                if (ans[v]==-1) {
                    ret.push_back({count_common_roads(thing), v});
                } else {
                    if (ans[v]==1 && mx == -1) mx = count_common_roads(thing);
                }
                thing.pop_back();
            }
            mx = max(mx, (*max_element(ret.begin(), ret.end())).first);
            for (auto [val, v]:ret) {
                if (val==mx) golden.push_back(v);
                ans[v] = (val==mx);
            }
        }
    }
    sort(golden.begin(), golden.end());
    golden.erase(unique(golden.begin(), golden.end()), golden.end());
    return golden;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i=0;i<U.size();i++) {
      |                  ~^~~~~~~~~
simurgh.cpp:37:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for (int i=0;i<U.size();i++) ans[i] = -1;
      |                      ~^~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 456 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 348 KB correct
7 Correct 0 ms 360 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 456 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 348 KB correct
7 Correct 0 ms 360 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 2 ms 344 KB correct
15 Correct 2 ms 348 KB correct
16 Correct 2 ms 452 KB correct
17 Correct 2 ms 344 KB correct
18 Correct 1 ms 348 KB correct
19 Correct 2 ms 348 KB correct
20 Correct 2 ms 348 KB correct
21 Correct 1 ms 348 KB correct
22 Correct 1 ms 488 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 2 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 480 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 344 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 1 ms 348 KB correct
33 Correct 1 ms 348 KB correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 456 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 348 KB correct
7 Correct 0 ms 360 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 2 ms 344 KB correct
15 Correct 2 ms 348 KB correct
16 Correct 2 ms 452 KB correct
17 Correct 2 ms 344 KB correct
18 Correct 1 ms 348 KB correct
19 Correct 2 ms 348 KB correct
20 Correct 2 ms 348 KB correct
21 Correct 1 ms 348 KB correct
22 Correct 1 ms 488 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 2 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 480 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 344 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 1 ms 348 KB correct
33 Correct 1 ms 348 KB correct
34 Incorrect 85 ms 1372 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Incorrect 66 ms 3660 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 456 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 348 KB correct
7 Correct 0 ms 360 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 2 ms 344 KB correct
15 Correct 2 ms 348 KB correct
16 Correct 2 ms 452 KB correct
17 Correct 2 ms 344 KB correct
18 Correct 1 ms 348 KB correct
19 Correct 2 ms 348 KB correct
20 Correct 2 ms 348 KB correct
21 Correct 1 ms 348 KB correct
22 Correct 1 ms 488 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 2 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 480 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 344 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 1 ms 348 KB correct
33 Correct 1 ms 348 KB correct
34 Incorrect 85 ms 1372 KB WA in grader: NO
35 Halted 0 ms 0 KB -