oj.uz

Submission #1031415

# Submission time Handle Problem Language Result Execution time Memory
1031415 2024-07-22T20:10:07 Z codexistent Love Polygon (BOI18_polygon) C++14
0 / 100
 2000 ms 35664 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];
bool d[MAXN];

int main(){
    cin >> n;
    FOR(i, 1, n){
        cin >> st[i];
        idx.insert({st[i], i});
        cin >> nx[i];
        ec[i] = 0;
    }

    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]++, adj[i].insert(idx[nx[i]]);
        ec[idx[nx[i]]]++, adj[idx[nx[i]]].insert(i);
    }

    set<pair<int, int>> se;
    FOR(i, 1, n) if(!d[i]) se.insert({adj[i].size(), i});

    while(se.size()){
        auto si = *se.begin();
        d[si.f] = true;

        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(!d[i]){
                    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});
                se.insert({ec[j2], j2});
            }
        }

        for(int i2 : adj[si.s]) {
            se.erase({ec[i2], i2});
            ec[i2]--;
            se.insert({ec[i2], i2});
        }

        se.erase(se.begin());
    }

    cout << r << endl;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2044 ms 11352 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11356 KB Output is correct
2 Correct 5 ms 11284 KB Output is correct
3 Runtime error 14 ms 22620 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2044 ms 35664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2044 ms 11352 KB Time limit exceeded
2 Halted 0 ms 0 KB -