oj.uz

답안 #1031501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031501 2024-07-22T22:13:57 Z codexistent Love Polygon (BOI18_polygon) C++14
50 / 100
 378 ms 33752 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;
        adj[i].insert(idx[nx[i]]);
        adj[idx[nx[i]]].insert(i);
    }
 
    int ct = 0;
    FOR(i, 1, n) if(!d[i]) ct++, se.insert({(int)adj[i].size(), i});
 
    while(ct && se.size()){
        auto si = *se.begin();

        d[si.s] = true, ct--;
 
        if(si.f == 0){
            r++;
        }else{
            int j = 0, jmn = INT_MAX;
            for(int i : adj[si.s]){
                if(jmn > (int)adj[i].size()) j = i, jmn = (int)adj[i].size();
            }
            r++;
 
            se.erase({jmn, j});
            for(int j2 : adj[j]){
                se.erase({(int)adj[j2].size(), j2});
                adj[j2].erase(j);
                se.insert({(int)adj[j2].size(), j2});
            }
        }
 
        for(int i2 : adj[si.s]) {
            se.erase({(int)adj[i2].size(), i2});
            adj[i2].erase(si.s);
            se.insert({(int)adj[i2].size(), i2});
        }
 
        se.erase(se.begin());
    }

 
    cout << r << endl;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11356 KB Output is correct
2 Correct 4 ms 11336 KB Output is correct
3 Correct 5 ms 11356 KB Output is correct
4 Correct 5 ms 11356 KB Output is correct
5 Correct 7 ms 11352 KB Output is correct
6 Correct 5 ms 11356 KB Output is correct
7 Correct 5 ms 11288 KB Output is correct
8 Correct 5 ms 11368 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct
10 Correct 5 ms 11356 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 5 ms 11356 KB Output is correct
13 Correct 5 ms 11356 KB Output is correct
14 Correct 4 ms 11356 KB Output is correct
15 Correct 4 ms 11356 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 11356 KB Output is correct
2 Correct 5 ms 11356 KB Output is correct
3 Correct 5 ms 11220 KB Output is correct
4 Correct 320 ms 33752 KB Output is correct
5 Incorrect 291 ms 32696 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 352 ms 33616 KB Output is correct
2 Correct 324 ms 33616 KB Output is correct
3 Correct 224 ms 24384 KB Output is correct
4 Correct 82 ms 19536 KB Output is correct
5 Correct 378 ms 33620 KB Output is correct
6 Correct 325 ms 33632 KB Output is correct
7 Correct 320 ms 33620 KB Output is correct
8 Correct 226 ms 29012 KB Output is correct
9 Correct 311 ms 33620 KB Output is correct
10 Correct 175 ms 33616 KB Output is correct
11 Correct 5 ms 11352 KB Output is correct
12 Correct 5 ms 11352 KB Output is correct
13 Correct 5 ms 11356 KB Output is correct
14 Correct 6 ms 11356 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 11356 KB Output is correct
2 Correct 4 ms 11336 KB Output is correct
3 Correct 5 ms 11356 KB Output is correct
4 Correct 5 ms 11356 KB Output is correct
5 Correct 7 ms 11352 KB Output is correct
6 Correct 5 ms 11356 KB Output is correct
7 Correct 5 ms 11288 KB Output is correct
8 Correct 5 ms 11368 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct
10 Correct 5 ms 11356 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 5 ms 11356 KB Output is correct
13 Correct 5 ms 11356 KB Output is correct
14 Correct 4 ms 11356 KB Output is correct
15 Correct 4 ms 11356 KB Output is correct
16 Correct 4 ms 11356 KB Output is correct
17 Correct 5 ms 11356 KB Output is correct
18 Correct 5 ms 11220 KB Output is correct
19 Correct 320 ms 33752 KB Output is correct
20 Incorrect 291 ms 32696 KB Output isn't correct
21 Halted 0 ms 0 KB -