oj.uz

Submission #1031494

# Submission time Handle Problem Language Result Execution time Memory
1031494 2024-07-22T22:04:37 Z codexistent Love Polygon (BOI18_polygon) C++14
50 / 100
 2000 ms 33708 KB 
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define f first
#define s second
 
int n, ec[MAXN];
string st[MAXN], nx[MAXN];
map<string, int> idx;
set<int> adj[MAXN];
set<pair<int, int>> se;
bool d[MAXN];
 
int main(){
    cin >> n;
    FOR(i, 1, n) ec[i] = 0;
    FOR(i, 1, n){
        cin >> st[i];
        idx.insert({st[i], i});
        cin >> nx[i];
    }
 
    if(n % 2) {
        cout << -1 << endl;
        return 0;
    }
 
    int r = 0;
    FOR(i, 1, n){
        d[i] = (idx[nx[idx[nx[i]]]] == i && idx[nx[i]] != i);
    }
 
    FOR(i, 1, n){
        if(i == idx[nx[i]] || d[i] || d[idx[nx[i]]]) continue;
        ec[i]++, ec[idx[nx[i]]]++;
    }
 
    FOR(i, 1, n){
        if(i == idx[nx[i]] || d[i] || d[idx[nx[i]]]) continue;
        adj[i].insert(idx[nx[i]]);
        adj[idx[nx[i]]].insert(i);
    }
 
    FOR(i, 1, n) if(!d[i]) se.insert({adj[i].size(), i});
 
    while(se.size()){
        auto si = *se.begin();
 
        if(si.f == 0){
            r++;
        }else{
            int j = 0, jmn = INT_MAX;
            for(int i : adj[si.s]){
                if(jmn > ec[i]) j = i, jmn = ec[i];
            }
            r++;
 
            se.erase({jmn, j});
            for(int j2 : adj[j]){
                se.erase({ec[j2], j2});
                adj[j2].erase(j), ec[j2]--;
                se.insert({ec[j2], j2});
            }
        }
 
        for(int i2 : adj[si.s]) {
            se.erase({ec[i2], i2});
            adj[i2].erase(si.s), ec[i2]--;
            se.insert({ec[i2], i2});
        }
 
        se.erase(se.begin());
    }
 
    cout << r << endl;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11352 KB Output is correct
2 Correct 4 ms 11356 KB Output is correct
3 Correct 4 ms 11356 KB Output is correct
4 Correct 4 ms 11356 KB Output is correct
5 Correct 5 ms 11356 KB Output is correct
6 Correct 4 ms 11356 KB Output is correct
7 Correct 4 ms 11356 KB Output is correct
8 Correct 5 ms 11356 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 4 ms 11356 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 5 ms 11164 KB Output is correct
13 Correct 4 ms 11300 KB Output is correct
14 Correct 5 ms 11356 KB Output is correct
15 Correct 5 ms 11356 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11356 KB Output is correct
2 Correct 5 ms 11352 KB Output is correct
3 Correct 5 ms 11352 KB Output is correct
4 Correct 377 ms 33628 KB Output is correct
5 Execution timed out 2037 ms 32848 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 33672 KB Output is correct
2 Correct 347 ms 33616 KB Output is correct
3 Correct 206 ms 24404 KB Output is correct
4 Correct 91 ms 19540 KB Output is correct
5 Correct 343 ms 33616 KB Output is correct
6 Correct 366 ms 33708 KB Output is correct
7 Correct 347 ms 33516 KB Output is correct
8 Correct 276 ms 28864 KB Output is correct
9 Correct 309 ms 33592 KB Output is correct
10 Correct 184 ms 33616 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 4 ms 11356 KB Output is correct
13 Correct 4 ms 11356 KB Output is correct
14 Correct 4 ms 11352 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11352 KB Output is correct
2 Correct 4 ms 11356 KB Output is correct
3 Correct 4 ms 11356 KB Output is correct
4 Correct 4 ms 11356 KB Output is correct
5 Correct 5 ms 11356 KB Output is correct
6 Correct 4 ms 11356 KB Output is correct
7 Correct 4 ms 11356 KB Output is correct
8 Correct 5 ms 11356 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 4 ms 11356 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 5 ms 11164 KB Output is correct
13 Correct 4 ms 11300 KB Output is correct
14 Correct 5 ms 11356 KB Output is correct
15 Correct 5 ms 11356 KB Output is correct
16 Correct 5 ms 11356 KB Output is correct
17 Correct 5 ms 11352 KB Output is correct
18 Correct 5 ms 11352 KB Output is correct
19 Correct 377 ms 33628 KB Output is correct
20 Execution timed out 2037 ms 32848 KB Time limit exceeded
21 Halted 0 ms 0 KB -