oj.uz

답안 #442382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442382 2021-07-07T15:45:42 Z AmineTrabelsi Split the Attractions (IOI19_split) C++14
18 / 100
 116 ms 16520 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
const int Mx = 2e5+5;
int N,M;
vector<int> order;
vector<int> gr[Mx];
bool vis[Mx];
void get_order(int node){
    vis[node] = 1;
    order.push_back(node);
    for(auto i:gr[node]){
        if(!vis[i])
        get_order(i);
    }
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    // subtask 1
    N = n;
    M = p.size();
    for(int i=0;i<M;i++){
        gr[p[i]].push_back(q[i]);
        gr[q[i]].push_back(p[i]);
    }
    vector<int> res(N,0);
    bool done = 0;
    for(int i=0;i<n;i++){
        if(gr[i].size() == 1){
            get_order(i);
            done = 1;
        }
    }
    if(!done)get_order(0); // cycle
    for(int i=0;i<a;i++){
        res[order[i]] = 1;
    }
    for(int i=0;i<b;i++){
        res[order[i+a]] = 2;
    }
    for(int i=0;i<c;i++){
        res[order[i+a+b]] = 3;
    }
    return res;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB ok, correct split
2 Correct 3 ms 4940 KB ok, correct split
3 Correct 3 ms 4940 KB ok, correct split
4 Correct 3 ms 4940 KB ok, correct split
5 Correct 3 ms 4940 KB ok, correct split
6 Correct 3 ms 4940 KB ok, correct split
7 Correct 79 ms 16516 KB ok, correct split
8 Correct 75 ms 16516 KB ok, correct split
9 Correct 74 ms 16452 KB ok, correct split
10 Correct 74 ms 16452 KB ok, correct split
11 Correct 79 ms 16520 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB ok, correct split
2 Correct 4 ms 4996 KB ok, correct split
3 Correct 3 ms 4940 KB ok, correct split
4 Correct 94 ms 15756 KB ok, correct split
5 Correct 67 ms 12556 KB ok, correct split
6 Correct 75 ms 16424 KB ok, correct split
7 Correct 79 ms 16488 KB ok, correct split
8 Correct 116 ms 15320 KB ok, correct split
9 Correct 73 ms 11976 KB ok, correct split
10 Correct 58 ms 12480 KB ok, correct split
11 Correct 57 ms 12424 KB ok, correct split
12 Correct 56 ms 12844 KB ok, correct split

Subtask #3
0 / 22.0

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

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 4996 KB 2 components are not connected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB ok, correct split
2 Correct 3 ms 4940 KB ok, correct split
3 Correct 3 ms 4940 KB ok, correct split
4 Correct 3 ms 4940 KB ok, correct split
5 Correct 3 ms 4940 KB ok, correct split
6 Correct 3 ms 4940 KB ok, correct split
7 Correct 79 ms 16516 KB ok, correct split
8 Correct 75 ms 16516 KB ok, correct split
9 Correct 74 ms 16452 KB ok, correct split
10 Correct 74 ms 16452 KB ok, correct split
11 Correct 79 ms 16520 KB ok, correct split
12 Correct 3 ms 4940 KB ok, correct split
13 Correct 4 ms 4996 KB ok, correct split
14 Correct 3 ms 4940 KB ok, correct split
15 Correct 94 ms 15756 KB ok, correct split
16 Correct 67 ms 12556 KB ok, correct split
17 Correct 75 ms 16424 KB ok, correct split
18 Correct 79 ms 16488 KB ok, correct split
19 Correct 116 ms 15320 KB ok, correct split
20 Correct 73 ms 11976 KB ok, correct split
21 Correct 58 ms 12480 KB ok, correct split
22 Correct 57 ms 12424 KB ok, correct split
23 Correct 56 ms 12844 KB ok, correct split
24 Correct 3 ms 4940 KB ok, correct split
25 Incorrect 67 ms 12548 KB 2 components are not connected
26 Halted 0 ms 0 KB -