oj.uz

Submission #1065082

# Submission time Handle Problem Language Result Execution time Memory
1065082 2024-08-18T22:25:56 Z beaconmc The Ties That Guide Us (CEOI23_incursion) C++17
30 / 100
 278 ms 15772 KB 
#include "incursion.h"

#include <bits/stdc++.h>
 
typedef int ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;



ll sub[50000];
vector<ll> edges[50000];
ll par[50000];
ll visited[50000];
ll depth[50000];
ll unsure[50000];
ll n;



void dfs(ll a, ll p, ll d){
    depth[a] = d;
    par[a] = p;
    sub[a] = 1;
    for (auto&i : edges[a]){
        if (i != p) dfs(i,a,d+1), sub[a] += sub[i];
    }
}

ll centfind(ll a, ll p){
    visited[a] = 1;
    for (auto&i : edges[a]){
        if (i!=p && sub[i] > n/2) return centfind(i, a);
    }
    return a;
}





vector<int> mark(std::vector<std::pair<int, int>> F, int safe) {
    n = (ll)F.size()+1;
    vector<int> ties(n);

    FOR(i,0,50000) edges[i].clear(), sub[i] = 0, par[i] = -1, depth[i] = 0, visited[i] = 0;

    for (auto&i : F){
        edges[i.first].push_back(i.second);
        edges[i.second].push_back(i.first);
    }
    dfs(3, -1, 0);

    ll cent = centfind(3, -1);
    ll root = -1;
    FOR(i,1,n+1){
        if (!visited[i]){
            root = i;
            dfs(root, -1, 0);
            break;
        }
    }
    ll cent2 = centfind(root, -1);


    dfs(cent, -1, 0);


    FOR(i,0,50000) visited[i] = 0;

    while (safe != -1){
        ties[safe-1] = 1;
        if (safe==cent || safe==cent2) break;
        safe = par[safe];
    }

    return ties;


}

bool cmp(ll a, ll b){
    return sub[a] < sub[b];
}

void locate(std::vector<std::pair<int, int>> F, int curr, int t) {
    n = (ll)F.size()+1;

    FOR(i,0,50000) edges[i].clear(), sub[i] = 0, par[i] = -1, depth[i] = 0, visited[i] = 0;

    for (auto&i : F){
        edges[i.first].push_back(i.second);
        edges[i.second].push_back(i.first);
    }
    dfs(1, -1, 0);

    ll cent = centfind(1, -1);
    ll root = -1;
    FOR(i,1,n+1){
        if (!visited[i]){
            root = i;
            dfs(root, -1, 0);
            break;
        }
    }
    ll cent2 = centfind(root, -1);


    dfs(cent, -1, 0);
    FOR(i,0,50000) visited[i] = 0;
    visited[curr] = 1;

    //cout << cent << endl;

    while (t != 1 && curr != cent){
        t = visit(par[curr]);
        curr = par[curr];
        visited[curr] = 1;
    }
    if (t != 1){
        t = visit(cent2);
        curr = cent2;
        visited[curr] = 1;
    }

    while (1){


        visited[curr] = 1;
        if (t==0 && curr!=cent){
            t = visit(par[curr]);
            curr = par[curr];
            continue;
        }
        sort(edges[curr].begin(), edges[curr].end(), cmp);
        reverse(edges[curr].begin(), edges[curr].end());
        bool done = false;


        for (auto&i : edges[curr]){

            if (i==par[curr]) continue;

            if (!visited[i]){
                visited[i] = true;
                t = visit(i);
                curr = i;
                done = true;
                break;
            }
        }

        if (!done){
            return;
        }


    }



}

Compilation message

interface.cpp: In function 'int main()':
interface.cpp:44:55: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     if(fread(T.data(), sizeof(int), 2 * N - 2, stdin) != 2 * N - 2) exit(0);
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
interface.cpp:50:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         int l = (numbers.size() == N ? N : 0);
      |                  ~~~~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4612 KB Correct

Subtask #1
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 14732 KB Correct
2 Correct 218 ms 15600 KB Correct
3 Correct 123 ms 15264 KB Correct
4 Correct 121 ms 15024 KB Correct
5 Correct 201 ms 15516 KB Correct
6 Correct 92 ms 15680 KB Correct
7 Correct 86 ms 14064 KB Correct
8 Correct 211 ms 14812 KB Correct
9 Correct 213 ms 14432 KB Correct
10 Correct 142 ms 15772 KB Correct
11 Correct 111 ms 15112 KB Correct
12 Correct 278 ms 15088 KB Correct
13 Incorrect 92 ms 14236 KB Not correct
14 Halted 0 ms 0 KB -

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 8960 KB Correct
2 Correct 75 ms 9372 KB Correct
3 Correct 82 ms 9116 KB Correct
4 Correct 87 ms 12376 KB Correct
5 Correct 138 ms 11992 KB Correct
6 Correct 153 ms 11800 KB Correct
7 Correct 87 ms 8696 KB Correct
8 Correct 77 ms 8760 KB Correct
9 Correct 81 ms 8876 KB Correct
10 Correct 78 ms 8864 KB Correct
11 Correct 76 ms 8776 KB Correct
12 Correct 76 ms 8860 KB Correct
13 Correct 77 ms 8780 KB Correct
14 Correct 50 ms 7824 KB Correct
15 Correct 61 ms 7824 KB Correct
16 Correct 79 ms 8932 KB Correct
17 Correct 82 ms 8860 KB Correct
18 Correct 86 ms 8772 KB Correct
19 Correct 79 ms 8860 KB Correct
20 Correct 51 ms 7856 KB Correct
21 Correct 55 ms 7832 KB Correct
22 Correct 64 ms 7828 KB Correct
23 Correct 56 ms 7832 KB Correct
24 Correct 61 ms 7820 KB Correct
25 Correct 56 ms 7836 KB Correct
26 Correct 76 ms 8864 KB Correct
27 Correct 82 ms 8932 KB Correct
28 Correct 80 ms 9200 KB Correct
29 Correct 83 ms 8948 KB Correct
30 Correct 73 ms 8960 KB Correct
31 Correct 73 ms 9048 KB Correct
32 Correct 83 ms 9120 KB Correct
33 Correct 81 ms 9188 KB Correct
34 Correct 78 ms 8944 KB Correct
35 Correct 80 ms 8864 KB Correct
36 Correct 81 ms 9092 KB Correct
37 Correct 78 ms 8952 KB Correct
38 Correct 82 ms 8868 KB Correct
39 Correct 72 ms 8944 KB Correct
40 Correct 83 ms 9128 KB Correct
41 Correct 77 ms 8860 KB Correct
42 Correct 83 ms 8864 KB Correct
43 Correct 77 ms 8944 KB Correct
44 Correct 71 ms 9036 KB Correct
45 Correct 78 ms 8692 KB Correct
46 Correct 78 ms 8940 KB Correct
47 Correct 72 ms 8952 KB Correct
48 Correct 78 ms 9116 KB Correct
49 Correct 86 ms 8948 KB Correct
50 Correct 79 ms 8912 KB Correct
51 Correct 80 ms 8948 KB Correct
52 Correct 77 ms 9220 KB Correct
53 Correct 70 ms 8956 KB Correct
54 Correct 79 ms 8952 KB Correct
55 Correct 79 ms 9200 KB Correct
56 Correct 82 ms 9696 KB Correct
57 Correct 77 ms 9116 KB Correct
58 Correct 81 ms 9204 KB Correct
59 Correct 82 ms 9120 KB Correct
60 Correct 81 ms 9212 KB Correct
61 Correct 71 ms 9120 KB Correct
62 Correct 78 ms 9628 KB Correct
63 Correct 79 ms 9284 KB Correct
64 Correct 79 ms 9208 KB Correct
65 Correct 83 ms 9288 KB Correct

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4612 KB Correct
2 Correct 209 ms 14732 KB Correct
3 Correct 218 ms 15600 KB Correct
4 Correct 123 ms 15264 KB Correct
5 Correct 121 ms 15024 KB Correct
6 Correct 201 ms 15516 KB Correct
7 Correct 92 ms 15680 KB Correct
8 Correct 86 ms 14064 KB Correct
9 Correct 211 ms 14812 KB Correct
10 Correct 213 ms 14432 KB Correct
11 Correct 142 ms 15772 KB Correct
12 Correct 111 ms 15112 KB Correct
13 Correct 278 ms 15088 KB Correct
14 Incorrect 92 ms 14236 KB Not correct
15 Halted 0 ms 0 KB -