oj.uz

답안 #925017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925017 2024-02-10T13:04:56 Z hmm789 Split the Attractions (IOI19_split) C++14
40 / 100
 72 ms 24376 KB 
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000000000000
#define MOD 998244353

vector<int> adj[100000], grpv[100000];
set<pair<int, tuple<int, int, int>>> adj2[100000];
vector<int> path, res;
vector<pair<int, int>> t1;
int sz[100000], grp[100000], d, e, c1 = -1, c2 = -1, cnt;
bool v[100000];

int size(int x, int g) {
    v[x] = 1; sz[x] = 1; grp[x] = g;
    if(g != -1) grpv[g].push_back(x);
    for(int i : adj[x]) if(!v[i]) {
        if(g == -1) sz[x] += size(i, i);
        else sz[x] += size(i, g);
    }
    return sz[x];
}

int centroid(int x, int n) {
    v[x] = 1;
    for(int i : adj[x]) if(!v[i] && sz[i] > n/2) return centroid(i, n);
    return x;
}

bool dfs(int x, int sz, int _c1, int _c2) {
    v[x] = 1;
    if(sz >= d) {
        c1 = _c1; c2 = _c2;
        path.push_back(x);
        return true;
    }
    for(auto i : adj2[x]) if(!v[i.first]) {
        if(dfs(i.first, sz+get<0>(i.second), get<1>(i.second), get<2>(i.second))) {
            path.push_back(x);
            return true;
        }
    }
    return false;
}

void dfs2(int x) {
    v[x] = 1;
    if(cnt == 0) return;
    res[x] = t1[0].second;
    cnt--;
    for(int i : adj[x]) if(!v[i] && grp[i] == grp[x]) dfs2(i);
}

void dfs3(int x) {
    if(cnt == 0) return;
    res[x] = t1[1].second;
    cnt--;
    for(int i : adj[x]) if(res[i] == 0) dfs3(i);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    for(int i = 0; i < n; i++) res.push_back(0);
    for(int i = 0; i < p.size(); i++) {
        adj[p[i]].push_back(q[i]);
        adj[q[i]].push_back(p[i]);
    }
    t1 = {{a, 1}, {b, 2}, {c, 3}};
    sort(t1.begin(), t1.end());
    d = t1[0].first; e = t1[1].first;
    size(0, -1);
    memset(v, 0, sizeof(v));
    int cen = centroid(0, n);
    memset(v, 0, sizeof(v));
    size(cen, -1);
    for(int i : adj[cen]) if(sz[i] >= d) {
        memset(v, 0, sizeof(v));
        cnt = d;
        dfs2(i);
        cnt = e;
        dfs3(cen);
        for(int j = 0; j < n; j++) if(res[j] == 0) res[j] = t1[2].second;
        return res;
    }
    for(int i = 0; i < n; i++) {
        for(int j : adj[i]) {
            if(grp[i] == -1 || grp[j] == -1) continue;
            if(grp[i] == grp[j]) continue;
            auto it = adj2[grp[i]].lower_bound({grp[j], {0, 0, 0}});
            if(it != adj2[grp[i]].end() && it->first == grp[j]) continue;
            adj2[grp[i]].insert({grp[j], {sz[grp[j]], i, j}});
            adj2[grp[j]].insert({grp[i], {sz[grp[i]], j, i}});
        }
    }
    memset(v, 0, sizeof(v));
    for(int i : adj[cen]) if(!v[i]) {
        if(dfs(i, sz[i], -1, -1)) break;
    }
    if(c1 == -1) return res;
    cnt = d;
    for(int i = 1; i < path.size(); i++) {
        for(int j : grpv[path[i]]) {
            res[j] = t1[0].second;
            cnt--;
        }
    }
    memset(v, 0, sizeof(v));
    dfs2(c2);
    cnt = e;
    dfs3(cen);
    for(int i = 0; i < n; i++) if(res[i] == 0) res[i] = t1[2].second;
    return res;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:62:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int i = 0; i < p.size(); i++) {
      |                    ~~^~~~~~~~~~
split.cpp:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for(int i = 1; i < path.size(); i++) {
      |                    ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10588 KB ok, correct split
2 Correct 3 ms 10588 KB ok, correct split
3 Correct 3 ms 10588 KB ok, correct split
4 Correct 3 ms 10588 KB ok, correct split
5 Correct 3 ms 10588 KB ok, correct split
6 Correct 3 ms 10588 KB ok, correct split
7 Correct 57 ms 24212 KB ok, correct split
8 Correct 51 ms 22472 KB ok, correct split
9 Correct 52 ms 21960 KB ok, correct split
10 Correct 54 ms 24272 KB ok, correct split
11 Correct 58 ms 24376 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10584 KB ok, correct split
2 Correct 3 ms 10584 KB ok, correct split
3 Correct 3 ms 10588 KB ok, correct split
4 Correct 62 ms 22732 KB ok, correct split
5 Correct 47 ms 18108 KB ok, correct split
6 Correct 52 ms 24272 KB ok, correct split
7 Correct 54 ms 22316 KB ok, correct split
8 Correct 72 ms 21448 KB ok, correct split
9 Correct 52 ms 18324 KB ok, correct split
10 Correct 45 ms 20424 KB ok, correct split
11 Correct 44 ms 20824 KB ok, correct split
12 Correct 49 ms 21068 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10584 KB ok, correct split
2 Correct 48 ms 18432 KB ok, correct split
3 Correct 18 ms 13660 KB ok, correct split
4 Correct 3 ms 10584 KB ok, correct split
5 Correct 62 ms 20580 KB ok, correct split
6 Correct 50 ms 20140 KB ok, correct split
7 Correct 54 ms 20116 KB ok, correct split
8 Correct 53 ms 20828 KB ok, correct split
9 Correct 56 ms 20168 KB ok, correct split
10 Correct 17 ms 13228 KB ok, no valid answer
11 Correct 25 ms 14552 KB ok, no valid answer
12 Correct 53 ms 19792 KB ok, no valid answer
13 Correct 46 ms 18508 KB ok, no valid answer
14 Correct 48 ms 21072 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10588 KB ok, correct split
2 Correct 3 ms 10532 KB ok, no valid answer
3 Correct 2 ms 10584 KB ok, correct split
4 Correct 3 ms 10588 KB ok, correct split
5 Correct 3 ms 10584 KB ok, correct split
6 Correct 3 ms 10588 KB ok, correct split
7 Correct 3 ms 10588 KB ok, correct split
8 Correct 3 ms 10400 KB ok, correct split
9 Correct 4 ms 10840 KB ok, correct split
10 Correct 4 ms 10844 KB ok, correct split
11 Correct 3 ms 10588 KB ok, correct split
12 Incorrect 5 ms 10844 KB invalid split: #1=800, #2=1596, #3=5
13 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10588 KB ok, correct split
2 Correct 3 ms 10588 KB ok, correct split
3 Correct 3 ms 10588 KB ok, correct split
4 Correct 3 ms 10588 KB ok, correct split
5 Correct 3 ms 10588 KB ok, correct split
6 Correct 3 ms 10588 KB ok, correct split
7 Correct 57 ms 24212 KB ok, correct split
8 Correct 51 ms 22472 KB ok, correct split
9 Correct 52 ms 21960 KB ok, correct split
10 Correct 54 ms 24272 KB ok, correct split
11 Correct 58 ms 24376 KB ok, correct split
12 Correct 3 ms 10584 KB ok, correct split
13 Correct 3 ms 10584 KB ok, correct split
14 Correct 3 ms 10588 KB ok, correct split
15 Correct 62 ms 22732 KB ok, correct split
16 Correct 47 ms 18108 KB ok, correct split
17 Correct 52 ms 24272 KB ok, correct split
18 Correct 54 ms 22316 KB ok, correct split
19 Correct 72 ms 21448 KB ok, correct split
20 Correct 52 ms 18324 KB ok, correct split
21 Correct 45 ms 20424 KB ok, correct split
22 Correct 44 ms 20824 KB ok, correct split
23 Correct 49 ms 21068 KB ok, correct split
24 Correct 3 ms 10584 KB ok, correct split
25 Correct 48 ms 18432 KB ok, correct split
26 Correct 18 ms 13660 KB ok, correct split
27 Correct 3 ms 10584 KB ok, correct split
28 Correct 62 ms 20580 KB ok, correct split
29 Correct 50 ms 20140 KB ok, correct split
30 Correct 54 ms 20116 KB ok, correct split
31 Correct 53 ms 20828 KB ok, correct split
32 Correct 56 ms 20168 KB ok, correct split
33 Correct 17 ms 13228 KB ok, no valid answer
34 Correct 25 ms 14552 KB ok, no valid answer
35 Correct 53 ms 19792 KB ok, no valid answer
36 Correct 46 ms 18508 KB ok, no valid answer
37 Correct 48 ms 21072 KB ok, no valid answer
38 Correct 3 ms 10588 KB ok, correct split
39 Correct 3 ms 10532 KB ok, no valid answer
40 Correct 2 ms 10584 KB ok, correct split
41 Correct 3 ms 10588 KB ok, correct split
42 Correct 3 ms 10584 KB ok, correct split
43 Correct 3 ms 10588 KB ok, correct split
44 Correct 3 ms 10588 KB ok, correct split
45 Correct 3 ms 10400 KB ok, correct split
46 Correct 4 ms 10840 KB ok, correct split
47 Correct 4 ms 10844 KB ok, correct split
48 Correct 3 ms 10588 KB ok, correct split
49 Incorrect 5 ms 10844 KB invalid split: #1=800, #2=1596, #3=5
50 Halted 0 ms 0 KB -