oj.uz

Submission #1038185

# Submission time Handle Problem Language Result Execution time Memory
1038185 2024-07-29T14:05:27 Z codexistent Love Polygon (BOI18_polygon) C++14
50 / 100
 2000 ms 38484 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>> e;
bool d[MAXN];
 
int main(){
    ios::sync_with_stdio(false);
	cin.tie(nullptr);

    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;
        e.insert({i, idx[nx[i]]});
        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]]);
        //cout << "DCVVB: " << idx[nx[i]] << endl;
        adj[idx[nx[i]]].insert(i);
    }
 
    set<pair<int, int>> se;
    FOR(i, 1, n) if(!d[i]) se.insert({ec[i], i});

    if((int)(se.size()) > n) {
        return 0;
    }
    
    while(se.size()){
        auto si = *se.begin();
 
        if(si.f == 0){
            r++;
            //cout << st[si.s] << " FALLALEUJAH! " << endl;
        }else{
            int j = 0, jmn = INT_MAX;
            for(int i : adj[si.s]){
                if(jmn > ec[i]) j = i, jmn = ec[i];
            }
            r++;
            //cout << st[si.s] << " ~ " << st[j] << " : " << si.s << " " << j << endl;
 
            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 << "\n";
}

Subtask #1
21.0 / 21.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 375 ms 38324 KB Output is correct
5 Execution timed out 2029 ms 37256 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 38444 KB Output is correct
2 Correct 359 ms 38484 KB Output is correct
3 Correct 177 ms 24168 KB Output is correct
4 Correct 62 ms 19460 KB Output is correct
5 Correct 370 ms 38368 KB Output is correct
6 Correct 378 ms 38272 KB Output is correct
7 Correct 362 ms 38224 KB Output is correct
8 Correct 268 ms 31312 KB Output is correct
9 Correct 347 ms 38480 KB Output is correct
10 Correct 203 ms 38480 KB Output is correct
11 Correct 2 ms 11356 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 11356 KB Output is correct
14 Correct 2 ms 11356 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 2 ms 11352 KB Output is correct
3 Correct 2 ms 11356 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 2 ms 11392 KB Output is correct
6 Correct 2 ms 11352 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11184 KB Output is correct
9 Correct 2 ms 11356 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct
11 Correct 2 ms 11356 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 11356 KB Output is correct
14 Correct 2 ms 11356 KB Output is correct
15 Correct 2 ms 11356 KB Output is correct
16 Correct 2 ms 11356 KB Output is correct
17 Correct 2 ms 11356 KB Output is correct
18 Correct 2 ms 11356 KB Output is correct
19 Correct 375 ms 38324 KB Output is correct
20 Execution timed out 2029 ms 37256 KB Time limit exceeded
21 Halted 0 ms 0 KB -