oj.uz

Submission #1065074

# Submission time Handle Problem Language Result Execution time Memory
1065074 2024-08-18T22:18:35 Z beaconmc The Ties That Guide Us (CEOI23_incursion) C++17
30 / 100
 264 ms 15936 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(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;

    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 4356 KB Correct

Subtask #1
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 15196 KB Correct
2 Correct 229 ms 15004 KB Correct
3 Correct 127 ms 14664 KB Correct
4 Correct 112 ms 15280 KB Correct
5 Correct 209 ms 14836 KB Correct
6 Correct 84 ms 15936 KB Correct
7 Correct 87 ms 14072 KB Correct
8 Correct 227 ms 14832 KB Correct
9 Correct 233 ms 15716 KB Correct
10 Correct 150 ms 14592 KB Correct
11 Correct 117 ms 15100 KB Correct
12 Correct 264 ms 13964 KB Correct
13 Incorrect 97 ms 15108 KB Not correct
14 Halted 0 ms 0 KB -

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 9036 KB Correct
2 Correct 90 ms 9120 KB Correct
3 Correct 84 ms 9124 KB Correct
4 Correct 97 ms 12188 KB Correct
5 Correct 141 ms 12024 KB Correct
6 Correct 161 ms 11756 KB Correct
7 Correct 84 ms 8860 KB Correct
8 Correct 76 ms 8688 KB Correct
9 Correct 84 ms 8860 KB Correct
10 Correct 88 ms 9100 KB Correct
11 Correct 81 ms 8696 KB Correct
12 Correct 73 ms 8692 KB Correct
13 Correct 77 ms 8804 KB Correct
14 Correct 48 ms 7848 KB Correct
15 Correct 55 ms 7848 KB Correct
16 Correct 67 ms 8872 KB Correct
17 Correct 76 ms 8860 KB Correct
18 Correct 78 ms 8948 KB Correct
19 Correct 78 ms 8864 KB Correct
20 Correct 56 ms 7836 KB Correct
21 Correct 48 ms 7844 KB Correct
22 Correct 63 ms 7836 KB Correct
23 Correct 54 ms 7840 KB Correct
24 Correct 62 ms 7868 KB Correct
25 Correct 55 ms 7848 KB Correct
26 Correct 76 ms 9376 KB Correct
27 Correct 79 ms 9196 KB Correct
28 Correct 79 ms 9024 KB Correct
29 Correct 71 ms 8860 KB Correct
30 Correct 78 ms 9116 KB Correct
31 Correct 83 ms 8924 KB Correct
32 Correct 83 ms 9212 KB Correct
33 Correct 76 ms 8860 KB Correct
34 Correct 78 ms 9376 KB Correct
35 Correct 80 ms 8928 KB Correct
36 Correct 82 ms 9120 KB Correct
37 Correct 78 ms 9032 KB Correct
38 Correct 82 ms 8952 KB Correct
39 Correct 82 ms 8948 KB Correct
40 Correct 84 ms 9460 KB Correct
41 Correct 75 ms 9016 KB Correct
42 Correct 79 ms 9112 KB Correct
43 Correct 80 ms 9060 KB Correct
44 Correct 76 ms 9116 KB Correct
45 Correct 71 ms 8916 KB Correct
46 Correct 84 ms 9084 KB Correct
47 Correct 87 ms 9144 KB Correct
48 Correct 79 ms 9196 KB Correct
49 Correct 78 ms 8872 KB Correct
50 Correct 89 ms 9180 KB Correct
51 Correct 82 ms 8864 KB Correct
52 Correct 90 ms 9448 KB Correct
53 Correct 84 ms 8920 KB Correct
54 Correct 81 ms 8944 KB Correct
55 Correct 83 ms 9116 KB Correct
56 Correct 82 ms 9116 KB Correct
57 Correct 81 ms 9376 KB Correct
58 Correct 75 ms 9484 KB Correct
59 Correct 81 ms 9104 KB Correct
60 Correct 79 ms 9372 KB Correct
61 Correct 78 ms 9372 KB Correct
62 Correct 91 ms 9472 KB Correct
63 Correct 87 ms 9200 KB Correct
64 Correct 79 ms 9220 KB Correct
65 Correct 70 ms 9120 KB Correct

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4356 KB Correct
2 Correct 227 ms 15196 KB Correct
3 Correct 229 ms 15004 KB Correct
4 Correct 127 ms 14664 KB Correct
5 Correct 112 ms 15280 KB Correct
6 Correct 209 ms 14836 KB Correct
7 Correct 84 ms 15936 KB Correct
8 Correct 87 ms 14072 KB Correct
9 Correct 227 ms 14832 KB Correct
10 Correct 233 ms 15716 KB Correct
11 Correct 150 ms 14592 KB Correct
12 Correct 117 ms 15100 KB Correct
13 Correct 264 ms 13964 KB Correct
14 Incorrect 97 ms 15108 KB Not correct
15 Halted 0 ms 0 KB -