oj.uz

Submission #393298

# Submission time Handle Problem Language Result Execution time Memory
393298 2021-04-23T07:00:27 Z jainbot27 Love Polygon (BOI18_polygon) C++17
100 / 100
 161 ms 16956 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int) x.size()
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)

#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define ROF(i, a, b) for(int i=(b-1); i>=(a); i--)
#define F0R(i, n) FOR(i, 0, n)
#define R0F(i, n) ROF(i, 0, n)
#define trav(x, y) for(auto&x:y)

using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using pll=pair<ll, ll>;
using pli=pair<ll, int>;
using vi=vector<int>;
using vl=vector<ll>;
using vpii=vector<pii>;

template<class T> inline bool ckmin(T&a, const T&b) {return b<a?a=b,1:0;}
template<class T> inline bool ckmax(T&a, const T&b) {return b>a?a=b,1:0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl='\n';
const int mxN=1e5+10;
const int MOD=1e9+7;
const ll infLL=1e18;
const ld eps=1e-6;

int n; 
string s[mxN], t[mxN];
map<string, int> mp;
int a[mxN];
int deg[mxN];
int par[mxN], sz[mxN];
bool alive[mxN];
int used[mxN];
queue<int> q;
int ans=0;

int Find(int u){
    return par[u]=(par[u]==u?par[u]:Find(par[u]));
}
bool comb(int e1, int e2){
    e1=Find(e1); e2=Find(e2); 
    if(e1==e2) return 0;
    if(sz[e1]<sz[e2]) swap(e1, e2);
    sz[e1]+=sz[e2]; sz[e2]=0;
    par[e2]=e1;
    return 1;
}

int32_t main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    if(n&1) {cout << "-1\n"; return 0;}
    F0R(i, n) par[i]=i, sz[i]=1;
    F0R(i, n)
        cin >> s[i] >> t[i], mp[s[i]]=i;
    F0R(i, n){
        a[i]=mp[t[i]];
        deg[a[i]]++;
        alive[i]=1;
    }    
    F0R(i, n){
        if(alive[i]&&a[i]!=i&&a[a[i]]==i){
            alive[a[i]]=0;
            alive[i]=0;
            deg[a[i]]--;
            deg[i]--;
        }
    }
    F0R(i, n)
        if(deg[i]==0){
            q.push(i);
        }       
    while(!q.empty()){
        auto T=q.front(); q.pop();
        assert(deg[T]==0);
        if(alive[T]==0) continue;
        if(alive[a[T]]==0) continue;
        alive[T]=0;
        alive[a[T]]=0;
        ans++;
        if(alive[a[a[T]]]) {
            deg[a[a[T]]]--;
            if(deg[a[a[T]]]==0)
                q.push(a[a[T]]);
        }
    }
    F0R(i, n){
        if(alive[i]&&alive[a[i]]){
            comb(a[i], i);
        }
    }
    F0R(i, n){
        if(alive[i]&&!used[Find(i)]){
            used[Find(i)]=1;
            ans+=(sz[Find(i)]+1)/2;
        }
    }
    cout << ans << nl;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 4 ms 6604 KB Output is correct
3 Correct 4 ms 6604 KB Output is correct
4 Correct 4 ms 6604 KB Output is correct
5 Correct 4 ms 6476 KB Output is correct
6 Correct 4 ms 6476 KB Output is correct
7 Correct 4 ms 6604 KB Output is correct
8 Correct 4 ms 6620 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 4 ms 6604 KB Output is correct
12 Correct 4 ms 6604 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 5 ms 6604 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 4 ms 6488 KB Output is correct
3 Correct 4 ms 6604 KB Output is correct
4 Correct 156 ms 16056 KB Output is correct
5 Correct 144 ms 16372 KB Output is correct
6 Correct 149 ms 16056 KB Output is correct
7 Correct 4 ms 6476 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 16476 KB Output is correct
2 Correct 147 ms 16440 KB Output is correct
3 Correct 134 ms 16380 KB Output is correct
4 Correct 4 ms 6540 KB Output is correct
5 Correct 146 ms 15988 KB Output is correct
6 Correct 154 ms 16628 KB Output is correct
7 Correct 138 ms 16580 KB Output is correct
8 Correct 138 ms 16592 KB Output is correct
9 Correct 139 ms 16956 KB Output is correct
10 Correct 106 ms 16388 KB Output is correct
11 Correct 4 ms 6604 KB Output is correct
12 Correct 4 ms 6604 KB Output is correct
13 Correct 4 ms 6604 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 4 ms 6604 KB Output is correct
3 Correct 4 ms 6604 KB Output is correct
4 Correct 4 ms 6604 KB Output is correct
5 Correct 4 ms 6476 KB Output is correct
6 Correct 4 ms 6476 KB Output is correct
7 Correct 4 ms 6604 KB Output is correct
8 Correct 4 ms 6620 KB Output is correct
9 Correct 4 ms 6604 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 4 ms 6604 KB Output is correct
12 Correct 4 ms 6604 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 5 ms 6604 KB Output is correct
16 Correct 4 ms 6604 KB Output is correct
17 Correct 4 ms 6488 KB Output is correct
18 Correct 4 ms 6604 KB Output is correct
19 Correct 156 ms 16056 KB Output is correct
20 Correct 144 ms 16372 KB Output is correct
21 Correct 149 ms 16056 KB Output is correct
22 Correct 4 ms 6476 KB Output is correct
23 Correct 149 ms 16476 KB Output is correct
24 Correct 147 ms 16440 KB Output is correct
25 Correct 134 ms 16380 KB Output is correct
26 Correct 4 ms 6540 KB Output is correct
27 Correct 146 ms 15988 KB Output is correct
28 Correct 154 ms 16628 KB Output is correct
29 Correct 138 ms 16580 KB Output is correct
30 Correct 138 ms 16592 KB Output is correct
31 Correct 139 ms 16956 KB Output is correct
32 Correct 106 ms 16388 KB Output is correct
33 Correct 4 ms 6604 KB Output is correct
34 Correct 4 ms 6604 KB Output is correct
35 Correct 4 ms 6604 KB Output is correct
36 Correct 4 ms 6604 KB Output is correct
37 Correct 142 ms 16492 KB Output is correct
38 Correct 161 ms 16672 KB Output is correct
39 Correct 145 ms 16596 KB Output is correct
40 Correct 140 ms 16536 KB Output is correct
41 Correct 140 ms 16708 KB Output is correct
42 Correct 146 ms 16528 KB Output is correct
43 Correct 142 ms 16488 KB Output is correct
44 Correct 139 ms 16576 KB Output is correct
45 Correct 148 ms 16588 KB Output is correct
46 Correct 146 ms 16480 KB Output is correct
47 Correct 144 ms 16876 KB Output is correct
48 Correct 142 ms 16452 KB Output is correct
49 Correct 141 ms 16436 KB Output is correct
50 Correct 139 ms 16396 KB Output is correct
51 Correct 4 ms 6476 KB Output is correct
52 Correct 145 ms 15976 KB Output is correct
53 Correct 148 ms 16580 KB Output is correct
54 Correct 142 ms 16556 KB Output is correct
55 Correct 147 ms 16536 KB Output is correct
56 Correct 151 ms 16668 KB Output is correct
57 Correct 104 ms 16452 KB Output is correct
58 Correct 4 ms 6604 KB Output is correct
59 Correct 4 ms 6604 KB Output is correct
60 Correct 4 ms 6604 KB Output is correct
61 Correct 4 ms 6608 KB Output is correct
62 Correct 4 ms 6604 KB Output is correct
63 Correct 4 ms 6604 KB Output is correct
64 Correct 4 ms 6604 KB Output is correct
65 Correct 148 ms 15988 KB Output is correct
66 Correct 149 ms 16476 KB Output is correct
67 Correct 155 ms 15940 KB Output is correct
68 Correct 4 ms 6476 KB Output is correct
69 Correct 4 ms 6604 KB Output is correct
70 Correct 4 ms 6604 KB Output is correct
71 Correct 4 ms 6604 KB Output is correct
72 Correct 4 ms 6604 KB Output is correct
73 Correct 4 ms 6476 KB Output is correct
74 Correct 4 ms 6476 KB Output is correct
75 Correct 4 ms 6604 KB Output is correct
76 Correct 4 ms 6604 KB Output is correct
77 Correct 4 ms 6604 KB Output is correct
78 Correct 4 ms 6608 KB Output is correct
79 Correct 4 ms 6604 KB Output is correct
80 Correct 4 ms 6604 KB Output is correct
81 Correct 4 ms 6604 KB Output is correct
82 Correct 4 ms 6604 KB Output is correct
83 Correct 4 ms 6604 KB Output is correct