oj.uz

Submission #633192

# Submission time Handle Problem Language Result Execution time Memory
633192 2022-08-21T20:52:01 Z Joshua_Andersson Love Polygon (BOI18_polygon) C++14
100 / 100
 246 ms 30668 KB 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
using namespace std;

#define enablell 0

typedef long long ll;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin__popcount(x)
#define leading_zeros(x) __builtin_clz(x)
#define gc() getchar_unlocked()
#if 0
#include <bits/extc++.h>
using namespace __gnu_pbds;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return x; }
};
//typedef __gnu_pbds::gp_hash_table<int, null_type, chash> h;
#endif

#endif

#define FILE_TC 0
#if FILE_TC
ifstream filein("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
#define cin filein
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T& a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define revall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))
#define first(a) (*begin(a))
#define indexpair(p, i) ((i==0)?p.first:p.second)
#define chmax(a,b) ((a)=max((a),b))
#define chmin(a,b) ((a)=min((a),b))

#define ceildiv(x,y) ((x + y - 1) / y)
#define fract(a) (a-floor(a))

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }

#if 0
auto Start = chrono::high_resolution_clock::now();
#define elapsedmillis() (chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count())
#define rununtil(time) if (elapsedmillis() >= time) break;
random_device rd;
mt19937 rng(rd());
#endif
const int mod = 1e9 + 7;

struct node
{
    int edge;
    set<int> redges;
    node() : edge(-1){}
};

void dfs(int u, vi& ret, vb& vis, vector<node>& edges)
{
    if (vis[u]) return;
    vis[u] = true;
    ret.push_back(u);
    dfs(edges[u].edge, ret, vis, edges);
}

int32_t main()
{
    fast();

    int nodenum = 0;
    map<string, int> nametonode;

    vector<node> edges;

    dread(int, n);
    if (n % 2 == 1)
    {
        cout << "-1";
        quit;
    }

    vb mated(n);
    rep(i,n)
    {
        dread2(string, a, b);
        if (!nametonode.count(a)) nametonode[a] = nodenum++;
        if (!nametonode.count(b)) nametonode[b] = nodenum++;

        int u = nametonode[a];
        int v = nametonode[b];
        while (max(u, v) >= edges.size()) edges.push_back({});



        edges[u].edge = v;
        edges[v].redges.insert(u);

        if (u!=v&&edges[v].edge==u)
        {
            mated[u] = 1;
            mated[v] = 1;
        }
    }

    queue<int> leafs;
    rep(i, edges.size())
    {
        if (edges[i].redges.size()==0)
        {
            leafs.push(i);
        }
    }

    

    set<int> loners;

    int ans = 0;
    while (leafs.size())
    {
        int u = leafs.front();
        leafs.pop();

        if (mated[edges[u].edge])
        {
            loners.insert(u);
        }
        else
        {
            int target = edges[u].edge;
            int targetsq = edges[target].edge;
            edges[targetsq].redges.erase(target);
            if (edges[targetsq].redges.size()==0)
            {
                leafs.push(targetsq);
            }
            mated[u] = 1;
            mated[target] = 1;
            ans++;
        }

    }

    // All that is left is loners and cycles
    // Loners != cycles of len 1

    // Find all cycles
    vvi cycles;
    vb vis(mated);
    rep(i, nodenum)
    {
        if (vis[i]||setcontains(loners,i)) continue;
        vi cycle;
        dfs(i, cycle, vis, edges);
        cycles.push_back(cycle);
    }

    rep(i, cycles.size())
    {
        if (cycles[i].size()==1)
        {
            loners.insert(cycles[i][0]);
        }
        else if (cycles[i].size()>2)
        {
            ans += cycles[i].size() / 2;
            if (cycles[i].size() % 2 == 1)
            {
                loners.insert(cycles[i].back());
            }
        }
    }

    if (loners.size() % 2 == 1) cout << -1;
    else
    {
        ans += loners.size();
        cout << ans;
    }

    quit;
}

Compilation message

polygon.cpp: In function 'int32_t main()':
polygon.cpp:179:26: warning: comparison of integer expressions of different signedness: 'const int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |         while (max(u, v) >= edges.size()) edges.push_back({});
      |                ~~~~~~~~~~^~~~~~~~~~~~~~~
polygon.cpp:103:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 | #define rep(i, high) for (int i = 0; i < high; i++)
......
  194 |     rep(i, edges.size())
      |         ~~~~~~~~~~~~~~~                 
polygon.cpp:194:5: note: in expansion of macro 'rep'
  194 |     rep(i, edges.size())
      |     ^~~
polygon.cpp:103:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 | #define rep(i, high) for (int i = 0; i < high; i++)
......
  246 |     rep(i, cycles.size())
      |         ~~~~~~~~~~~~~~~~                
polygon.cpp:246:5: note: in expansion of macro 'rep'
  246 |     rep(i, cycles.size())
      |     ^~~

Subtask #1
21.0 / 21.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 198 ms 23116 KB Output is correct
5 Correct 205 ms 22112 KB Output is correct
6 Correct 207 ms 23340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 18336 KB Output is correct
2 Correct 234 ms 20548 KB Output is correct
3 Correct 190 ms 30616 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 204 ms 20492 KB Output is correct
6 Correct 233 ms 20636 KB Output is correct
7 Correct 218 ms 20708 KB Output is correct
8 Correct 195 ms 22660 KB Output is correct
9 Correct 228 ms 21624 KB Output is correct
10 Correct 183 ms 25128 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 198 ms 23116 KB Output is correct
20 Correct 205 ms 22112 KB Output is correct
21 Correct 207 ms 23340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 224 ms 18336 KB Output is correct
24 Correct 234 ms 20548 KB Output is correct
25 Correct 190 ms 30616 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 204 ms 20492 KB Output is correct
28 Correct 233 ms 20636 KB Output is correct
29 Correct 218 ms 20708 KB Output is correct
30 Correct 195 ms 22660 KB Output is correct
31 Correct 228 ms 21624 KB Output is correct
32 Correct 183 ms 25128 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 320 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 226 ms 20432 KB Output is correct
38 Correct 245 ms 20664 KB Output is correct
39 Correct 216 ms 20744 KB Output is correct
40 Correct 216 ms 20696 KB Output is correct
41 Correct 220 ms 20640 KB Output is correct
42 Correct 223 ms 20632 KB Output is correct
43 Correct 216 ms 20644 KB Output is correct
44 Correct 233 ms 20520 KB Output is correct
45 Correct 219 ms 20616 KB Output is correct
46 Correct 221 ms 20756 KB Output is correct
47 Correct 243 ms 21624 KB Output is correct
48 Correct 215 ms 20508 KB Output is correct
49 Correct 220 ms 20716 KB Output is correct
50 Correct 177 ms 30668 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 237 ms 20424 KB Output is correct
53 Correct 214 ms 20728 KB Output is correct
54 Correct 207 ms 20592 KB Output is correct
55 Correct 246 ms 22696 KB Output is correct
56 Correct 235 ms 21592 KB Output is correct
57 Correct 170 ms 25152 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1 ms 320 KB Output is correct
63 Correct 1 ms 320 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 211 ms 22956 KB Output is correct
66 Correct 224 ms 22020 KB Output is correct
67 Correct 201 ms 23336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 0 ms 328 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 1 ms 320 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 0 ms 324 KB Output is correct
79 Correct 0 ms 324 KB Output is correct
80 Correct 0 ms 324 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct