oj.uz

답안 #521010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521010 2022-01-31T15:38:18 Z lordlorinc Split the Attractions (IOI19_split) C++17
18 / 100
 91 ms 11316 KB 
#include "split.h"
#include<bits/stdc++.h>

using namespace std;

vector<int> res;
vector<vector<int> > graph;
vector<bool> vis;

int aa, bb, cc;

void dfs(int pos){
    // cout << pos << " " << a << " " << b << endl;
    bool ae = true;
    if (aa != 0) {

        res[pos] = 1;
        aa--;
    }
    else {
        res[pos] = 2;
        bb--;
    }

    vis[pos] = true;

    for (int x : graph[pos]){
        if(vis[x]) continue;
        if (bb > 0) dfs(x);
    }
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    // cout << n << " " << a << " " << b << endl;
    res.assign(n, 3);
	int start = 0;
	graph.assign(n, vector<int>(0));
	vis.assign(n, false);
	int m = p.size();
	for (int i = 0; i < m; i++){
        graph[p[i]].push_back(q[i]);
        graph[q[i]].push_back(p[i]);
        // cout << p[i] << " " << q[i] << endl;
	}

	for (int i = 0; i < n; i++){
        if (graph[i].size() < 2) start = i;
	}

	aa = a, bb = b, cc = c;

	dfs(start);

	return res;
}

/*

6 5 2 2 2
0 1
1 2
2 3
3 4
4 5


*/

Compilation message

split.cpp: In function 'void dfs(int)':
split.cpp:14:10: warning: unused variable 'ae' [-Wunused-variable]
   14 |     bool ae = true;
      |          ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 1 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 0 ms 204 KB ok, correct split
6 Correct 0 ms 204 KB ok, correct split
7 Correct 46 ms 10160 KB ok, correct split
8 Correct 53 ms 11204 KB ok, correct split
9 Correct 59 ms 11224 KB ok, correct split
10 Correct 42 ms 8140 KB ok, correct split
11 Correct 48 ms 10112 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 72 ms 9148 KB ok, correct split
5 Correct 58 ms 8188 KB ok, correct split
6 Correct 47 ms 8980 KB ok, correct split
7 Correct 62 ms 10488 KB ok, correct split
8 Correct 91 ms 11316 KB ok, correct split
9 Correct 53 ms 8900 KB ok, correct split
10 Correct 55 ms 9092 KB ok, correct split
11 Correct 59 ms 9176 KB ok, correct split
12 Correct 41 ms 9020 KB ok, correct split

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Incorrect 56 ms 8152 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Incorrect 1 ms 204 KB 2 components are not connected
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 1 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 0 ms 204 KB ok, correct split
6 Correct 0 ms 204 KB ok, correct split
7 Correct 46 ms 10160 KB ok, correct split
8 Correct 53 ms 11204 KB ok, correct split
9 Correct 59 ms 11224 KB ok, correct split
10 Correct 42 ms 8140 KB ok, correct split
11 Correct 48 ms 10112 KB ok, correct split
12 Correct 1 ms 204 KB ok, correct split
13 Correct 0 ms 204 KB ok, correct split
14 Correct 0 ms 204 KB ok, correct split
15 Correct 72 ms 9148 KB ok, correct split
16 Correct 58 ms 8188 KB ok, correct split
17 Correct 47 ms 8980 KB ok, correct split
18 Correct 62 ms 10488 KB ok, correct split
19 Correct 91 ms 11316 KB ok, correct split
20 Correct 53 ms 8900 KB ok, correct split
21 Correct 55 ms 9092 KB ok, correct split
22 Correct 59 ms 9176 KB ok, correct split
23 Correct 41 ms 9020 KB ok, correct split
24 Correct 0 ms 204 KB ok, correct split
25 Incorrect 56 ms 8152 KB 2 components are not connected
26 Halted 0 ms 0 KB -