oj.uz

Submission #796954

# Submission time Handle Problem Language Result Execution time Memory
796954 2023-07-29T00:40:45 Z Magikarp4000 Simurgh (IOI17_simurgh) C++17
51 / 100
 126 ms 9712 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 1e5+5;
int n,m;
int p[MAXN], sz[MAXN];
vector<int> e, comp[MAXN];
vector<PII> v[MAXN], edges;
bool z[MAXN], ze[MAXN], res[MAXN], done[MAXN]; // ze = visited edge, done = processed edge
vector<int> toclr;

int finds(int x) {
    if (p[x] != x) p[x] = finds(p[x]);
    return p[x];
}

void unite(int a, int b, int idx) {
    a = finds(a);
    b = finds(b);
    if (a != b) {
        if (sz[a] < sz[b]) swap(a,b);
        p[b] = a;
        sz[a] += sz[b];
        e.PB(idx);
    }
}

void reset() {
    FOR(i,0,n) z[i] = 0, p[i] = i, sz[i] = 1;
    FORX(u,toclr) ze[u] = 0;
    toclr.clear();
    e.clear();
    FOR(i,0,n) comp[i].clear();
}

void dfs(int s, int num, int src) {
    if (z[s]) return;
    z[s] = 1;
    FORX(u,v[s]) {
        if (u.F == src) {
            ze[u.S] = 1;
            toclr.PB(u.S);
            comp[num].PB(u.S);
        }
        else dfs(u.F,num,src);
    }
}

void print(int s) {
    cout << "s: " << s << "| e: ";
    FORX(y,e) cout << y << " ";
    cout << ln;
}

void solve(int s) {
    reset(); // common w reset
    int cnt = 0;
    // FOR(i,0,m) cout << ze[i] << " ";
    // cout << ln;
    FORX(u,v[s]) {
        if (ze[u.S]) continue;
        ze[u.S] = 1;
        toclr.PB(u.S);
        dfs(u.F,cnt++,s);
    }
    FOR(j,0,m) {
        if (edges[j].F != s && edges[j].S != s) unite(edges[j].F,edges[j].S,j);
    }
    // cout << "s: " << s << ln;
    // FOR(i,0,cnt) {
    //     cout << i << ": ";
    //     FORX(u,comp[i]) cout << u << " ";
    //     cout << ln;
    // }
    FOR(i,0,cnt) {
        // if (comp[i].empty()) continue;
        FOR(j,0,cnt) if (j != i) e.PB(comp[j][0]);
        vector<int> le,gr;
        int orig = -INF, start = 1, isgold = -1;
        FORX(u,comp[i]) {
            if (done[u]) {
                e.PB(u);
                // print(s);
                orig = count_common_roads(e);
                e.pop_back();
                isgold = res[u];
                start = 0;
                break;
            }
        }
        if (isgold == -1) {
            e.PB(comp[i][0]); le.PB(comp[i][0]);
            // print(s);
            orig = count_common_roads(e);
            e.pop_back();
        }
        // int start = 0, cn = comp[i].size();
        // while (start < cn && done[comp[i][start]]) start++;
        // start = max(0,start-1);
        // if (start >= cn) continue;
        // e.PB(comp[i][start]); le.PB(comp[i][start]);
        // cout << "s: " << s << "| e: ";
        // FORX(y,e) cout << y << " ";
        // cout << ln;
        // int orig = count_common_roads(e);
        // e.pop_back();
        bool sm = 0;
        FOR(k,start,comp[i].size()) {
            int u = comp[i][k];
            if (done[u]) continue;
            e.PB(u);
            // print(s);
            int cur = count_common_roads(e);
            e.pop_back(); // reset single edge
            if (orig < cur) sm = 1, gr.PB(u);
            else if (orig == cur) le.PB(u);
        }
        if (sm || isgold == 0) FORX(y,gr) res[y] = 1;
        else FORX(y,le) res[y] = 1;
        FOR(j,0,cnt-1) e.pop_back(); // reset component edges
    }
    FORX(u,v[s]) done[u.S] = 1;
}

std::vector<int> find_roads(int N, std::vector<int> U, std::vector<int> V) {
    n = N; m = U.size();
    FOR(i,0,m) {
        edges.PB({U[i],V[i]});
        v[U[i]].PB({V[i],i}), v[V[i]].PB({U[i],i});
    }
    FOR(i,0,n) solve(i);
    vector<int> resv;
    FOR(i,0,m) if (res[i]) resv.PB(i);
    // cout << ln;
    // FORX(u,resv) cout << u << " ";
    // cout << ln;
    return resv;
    // cout << "xd\n";
    // FORX(u,res) cout << u << " ";
    // cout << ln;
}

Compilation message

simurgh.cpp: In function 'void solve(int)':
simurgh.cpp:11:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define FOR(i,s,n) for (int i = s; i < n; i++)
......
  130 |         FOR(k,start,comp[i].size()) {
      |             ~~~~~~~~~~~~~~~~~~~~~~    
simurgh.cpp:130:9: note: in expansion of macro 'FOR'
  130 |         FOR(k,start,comp[i].size()) {
      |         ^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5012 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 5076 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 3 ms 4948 KB correct
9 Correct 2 ms 5004 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4948 KB correct
13 Correct 3 ms 4920 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5012 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 5076 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 3 ms 4948 KB correct
9 Correct 2 ms 5004 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4948 KB correct
13 Correct 3 ms 4920 KB correct
14 Correct 4 ms 5004 KB correct
15 Correct 4 ms 5012 KB correct
16 Correct 4 ms 5044 KB correct
17 Correct 4 ms 5012 KB correct
18 Correct 4 ms 4948 KB correct
19 Correct 3 ms 5076 KB correct
20 Correct 3 ms 5076 KB correct
21 Correct 3 ms 5008 KB correct
22 Correct 3 ms 5012 KB correct
23 Correct 4 ms 5008 KB correct
24 Correct 3 ms 4948 KB correct
25 Correct 3 ms 4948 KB correct
26 Correct 3 ms 4948 KB correct
27 Correct 3 ms 5004 KB correct
28 Correct 3 ms 4948 KB correct
29 Correct 3 ms 4948 KB correct
30 Correct 3 ms 4948 KB correct
31 Correct 3 ms 5012 KB correct
32 Correct 3 ms 4948 KB correct
33 Correct 3 ms 4948 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5012 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 5076 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 3 ms 4948 KB correct
9 Correct 2 ms 5004 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4948 KB correct
13 Correct 3 ms 4920 KB correct
14 Correct 4 ms 5004 KB correct
15 Correct 4 ms 5012 KB correct
16 Correct 4 ms 5044 KB correct
17 Correct 4 ms 5012 KB correct
18 Correct 4 ms 4948 KB correct
19 Correct 3 ms 5076 KB correct
20 Correct 3 ms 5076 KB correct
21 Correct 3 ms 5008 KB correct
22 Correct 3 ms 5012 KB correct
23 Correct 4 ms 5008 KB correct
24 Correct 3 ms 4948 KB correct
25 Correct 3 ms 4948 KB correct
26 Correct 3 ms 4948 KB correct
27 Correct 3 ms 5004 KB correct
28 Correct 3 ms 4948 KB correct
29 Correct 3 ms 4948 KB correct
30 Correct 3 ms 4948 KB correct
31 Correct 3 ms 5012 KB correct
32 Correct 3 ms 4948 KB correct
33 Correct 3 ms 4948 KB correct
34 Correct 119 ms 6484 KB correct
35 Correct 118 ms 6536 KB correct
36 Correct 89 ms 6156 KB correct
37 Correct 10 ms 5120 KB correct
38 Correct 122 ms 6588 KB correct
39 Correct 126 ms 6392 KB correct
40 Correct 82 ms 6268 KB correct
41 Correct 124 ms 6488 KB correct
42 Correct 118 ms 6480 KB correct
43 Correct 65 ms 5972 KB correct
44 Correct 53 ms 5672 KB correct
45 Correct 67 ms 5788 KB correct
46 Correct 47 ms 5588 KB correct
47 Correct 23 ms 5280 KB correct
48 Correct 5 ms 5008 KB correct
49 Correct 10 ms 5012 KB correct
50 Correct 22 ms 5364 KB correct
51 Correct 60 ms 5836 KB correct
52 Correct 55 ms 5716 KB correct
53 Correct 49 ms 5672 KB correct
54 Correct 65 ms 5972 KB correct
55 Correct 60 ms 5748 KB correct
56 Correct 65 ms 5844 KB correct
57 Correct 69 ms 5844 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB correct
2 Correct 3 ms 4948 KB correct
3 Incorrect 81 ms 9712 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5012 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 5076 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 3 ms 4948 KB correct
9 Correct 2 ms 5004 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4948 KB correct
13 Correct 3 ms 4920 KB correct
14 Correct 4 ms 5004 KB correct
15 Correct 4 ms 5012 KB correct
16 Correct 4 ms 5044 KB correct
17 Correct 4 ms 5012 KB correct
18 Correct 4 ms 4948 KB correct
19 Correct 3 ms 5076 KB correct
20 Correct 3 ms 5076 KB correct
21 Correct 3 ms 5008 KB correct
22 Correct 3 ms 5012 KB correct
23 Correct 4 ms 5008 KB correct
24 Correct 3 ms 4948 KB correct
25 Correct 3 ms 4948 KB correct
26 Correct 3 ms 4948 KB correct
27 Correct 3 ms 5004 KB correct
28 Correct 3 ms 4948 KB correct
29 Correct 3 ms 4948 KB correct
30 Correct 3 ms 4948 KB correct
31 Correct 3 ms 5012 KB correct
32 Correct 3 ms 4948 KB correct
33 Correct 3 ms 4948 KB correct
34 Correct 119 ms 6484 KB correct
35 Correct 118 ms 6536 KB correct
36 Correct 89 ms 6156 KB correct
37 Correct 10 ms 5120 KB correct
38 Correct 122 ms 6588 KB correct
39 Correct 126 ms 6392 KB correct
40 Correct 82 ms 6268 KB correct
41 Correct 124 ms 6488 KB correct
42 Correct 118 ms 6480 KB correct
43 Correct 65 ms 5972 KB correct
44 Correct 53 ms 5672 KB correct
45 Correct 67 ms 5788 KB correct
46 Correct 47 ms 5588 KB correct
47 Correct 23 ms 5280 KB correct
48 Correct 5 ms 5008 KB correct
49 Correct 10 ms 5012 KB correct
50 Correct 22 ms 5364 KB correct
51 Correct 60 ms 5836 KB correct
52 Correct 55 ms 5716 KB correct
53 Correct 49 ms 5672 KB correct
54 Correct 65 ms 5972 KB correct
55 Correct 60 ms 5748 KB correct
56 Correct 65 ms 5844 KB correct
57 Correct 69 ms 5844 KB correct
58 Correct 3 ms 4948 KB correct
59 Correct 3 ms 4948 KB correct
60 Incorrect 81 ms 9712 KB WA in grader: NO
61 Halted 0 ms 0 KB -