oj.uz

Submission #366892

# Submission time Handle Problem Language Result Execution time Memory
366892 2021-02-15T16:18:11 Z ACmachine Love Polygon (BOI18_polygon) C++17
100 / 100
 257 ms 11520 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

   

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n; cin >> n;
    if(n % 2 == 1){
        cout << -1 << "\n";
        return 0;
    }
    vector<int> g(n);
    int curr_id = 0;
    map<string, int> name_to_id;
    REP(i, n){
        string s, t;
        cin >> s >> t;
        int u, v;
        if(name_to_id.find(s) == name_to_id.end())
            name_to_id[s] = curr_id++;
        if(name_to_id.find(t) == name_to_id.end())
            name_to_id[t] = curr_id++;
        u = name_to_id[s];
        v = name_to_id[t];
        g[u] = v;
    }
    vector<bool> visited(n, false);
    queue<int> q;
    vi deg(n, 0);
    REP(i, n) deg[g[i]]++;
    REP(i, n){
        if(g[g[i]] == i && i != g[i]){
            visited[i] = visited[g[i]] = true;
        }
        if(deg[i] == 0) 
            q.push(i);
    }
    int ans = 0;
    while(!q.empty()){
        int v = q.front(); q.pop();
        visited[v] = true;
        ans++;
        if(!visited[g[v]]){
            visited[g[v]] = true; 
            deg[g[g[v]]]--;
            if(deg[g[g[v]]] == 0)
                q.push(g[g[v]]);
        }
    }
    REP(i, n){
        if(!visited[i]){
            int cnt = 1;
            for(int j = g[i]; j != i; j = g[j]){
                cnt++;
                visited[j] = true;
            }
            ans += (cnt + 1) / 2;
        }
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
21.0 / 21.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 240 ms 10220 KB Output is correct
5 Correct 234 ms 10220 KB Output is correct
6 Correct 240 ms 10332 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 9068 KB Output is correct
2 Correct 241 ms 9068 KB Output is correct
3 Correct 201 ms 8940 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 237 ms 8940 KB Output is correct
6 Correct 228 ms 9196 KB Output is correct
7 Correct 228 ms 9196 KB Output is correct
8 Correct 242 ms 9068 KB Output is correct
9 Correct 214 ms 9324 KB Output is correct
10 Correct 179 ms 9324 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 240 ms 10220 KB Output is correct
20 Correct 234 ms 10220 KB Output is correct
21 Correct 240 ms 10332 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 248 ms 9068 KB Output is correct
24 Correct 241 ms 9068 KB Output is correct
25 Correct 201 ms 8940 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 237 ms 8940 KB Output is correct
28 Correct 228 ms 9196 KB Output is correct
29 Correct 228 ms 9196 KB Output is correct
30 Correct 242 ms 9068 KB Output is correct
31 Correct 214 ms 9324 KB Output is correct
32 Correct 179 ms 9324 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 0 ms 364 KB Output is correct
36 Correct 0 ms 364 KB Output is correct
37 Correct 231 ms 11244 KB Output is correct
38 Correct 235 ms 11372 KB Output is correct
39 Correct 230 ms 11372 KB Output is correct
40 Correct 228 ms 11372 KB Output is correct
41 Correct 230 ms 11372 KB Output is correct
42 Correct 229 ms 11520 KB Output is correct
43 Correct 231 ms 11244 KB Output is correct
44 Correct 238 ms 11244 KB Output is correct
45 Correct 232 ms 11244 KB Output is correct
46 Correct 234 ms 11372 KB Output is correct
47 Correct 221 ms 11500 KB Output is correct
48 Correct 247 ms 11408 KB Output is correct
49 Correct 257 ms 11244 KB Output is correct
50 Correct 196 ms 11268 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 248 ms 11184 KB Output is correct
53 Correct 228 ms 11372 KB Output is correct
54 Correct 244 ms 11344 KB Output is correct
55 Correct 229 ms 11372 KB Output is correct
56 Correct 222 ms 11372 KB Output is correct
57 Correct 176 ms 11500 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 242 ms 11120 KB Output is correct
66 Correct 240 ms 11196 KB Output is correct
67 Correct 239 ms 11116 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 1 ms 364 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct