oj.uz

Submission #645220

# Submission time Handle Problem Language Result Execution time Memory
645220 2022-09-26T13:05:22 Z mychecksedad Love Polygon (BOI18_polygon) C++17
21 / 100
 2000 ms 1048576 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;

int n, to[N], dep[N], res = 0;
string x, y;
vector<int> in(N);
map<string, int> s;
vector<int> g[N];
vector<bool> vis(N);
void dfs(int v, int p, int d){
    dep[v] = d;   
    for(int u: g[v]){
        if(vis[u]){
            if(d > 1) res += d/2 + !(d&1);
        }else dfs(u, v, d + 1);
    }
}


void solve(){
    cin >> n;
    int c = 1;
    for(int i = 0; i < n; ++i){
        cin >> x >> y;
        if(s[x] == 0) s[x] = c++;
        if(s[y] == 0) s[y] = c++;
        to[s[x] - 1] = s[y] - 1;
        g[s[x]-1].pb(s[y] - 1);
    }
    if(n&1){
        cout << -1;
        return;
    }
    if(n <= 20){
        int ans = n;
        for(int mask = 0; mask < (1<<n); ++mask){

            bool ok = 1;
            vector<int> v;

            for(int j = 0; j < n; ++j){
                if(!((1<<j)&mask)){
                    v.pb(to[j]);
                    if(to[j] == j) ok = 0;
                    else if(!(to[to[j]] == j || ((1<<to[j])&mask))) ok = 0;
                }
            }
            sort(all(v));
            
            for(int j = 0; j < int(v.size()) - 1; ++j) if(v[j] == v[j + 1]) ok = 0;
            

            if(ok){
                if(ans > __builtin_popcount(mask)){
                    ans = __builtin_popcount(mask);
                }
            }
        }
        cout << ans;
        return;
    }

    dfs(1, 0, 0);
    cout << res;
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

polygon.cpp: In function 'int main()':
polygon.cpp:84:16: warning: unused variable 'aa' [-Wunused-variable]
   84 |     int T = 1, aa;
      |                ^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 27752 KB Output is correct
2 Correct 226 ms 27800 KB Output is correct
3 Correct 278 ms 27860 KB Output is correct
4 Correct 13 ms 27860 KB Output is correct
5 Correct 14 ms 27860 KB Output is correct
6 Correct 14 ms 27804 KB Output is correct
7 Correct 266 ms 27816 KB Output is correct
8 Correct 284 ms 27740 KB Output is correct
9 Correct 275 ms 27860 KB Output is correct
10 Correct 274 ms 27744 KB Output is correct
11 Correct 296 ms 27860 KB Output is correct
12 Correct 13 ms 27848 KB Output is correct
13 Correct 13 ms 27792 KB Output is correct
14 Correct 13 ms 27860 KB Output is correct
15 Correct 13 ms 27860 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 27860 KB Output is correct
2 Correct 13 ms 27784 KB Output is correct
3 Correct 13 ms 27844 KB Output is correct
4 Execution timed out 2122 ms 931228 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 728 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 27752 KB Output is correct
2 Correct 226 ms 27800 KB Output is correct
3 Correct 278 ms 27860 KB Output is correct
4 Correct 13 ms 27860 KB Output is correct
5 Correct 14 ms 27860 KB Output is correct
6 Correct 14 ms 27804 KB Output is correct
7 Correct 266 ms 27816 KB Output is correct
8 Correct 284 ms 27740 KB Output is correct
9 Correct 275 ms 27860 KB Output is correct
10 Correct 274 ms 27744 KB Output is correct
11 Correct 296 ms 27860 KB Output is correct
12 Correct 13 ms 27848 KB Output is correct
13 Correct 13 ms 27792 KB Output is correct
14 Correct 13 ms 27860 KB Output is correct
15 Correct 13 ms 27860 KB Output is correct
16 Correct 13 ms 27860 KB Output is correct
17 Correct 13 ms 27784 KB Output is correct
18 Correct 13 ms 27844 KB Output is correct
19 Execution timed out 2122 ms 931228 KB Time limit exceeded
20 Halted 0 ms 0 KB -