oj.uz

Submission #576771

# Submission time Handle Problem Language Result Execution time Memory
576771 2022-06-13T12:48:29 Z Sam_a17 Love Polygon (BOI18_polygon) C++14
0 / 100
 2000 ms 17228 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 10;
int n, it = 1, ci = 1, answ, kent, bordyur[N];
int inCycle[N];
unordered_map<string, int> mp;
vector<int> adj[N];
int used[N], p[N], in[N], start[N];

void dfs(int node, int parent, int curr) {
  used[node] = 1, p[node] = parent;
  for(auto i: adj[node]) {
    if(i == parent) continue;

    if(used[i] == 1) {
      int curr = node, cnt = 1;
      inCycle[curr] = ci;
      
      while(curr != i) {
        curr = p[curr];
        inCycle[curr] = ci;
        cnt++;
      }

      if(curr % 2 == 0) {
        answ += curr / 2;
        return;
      }

      if(curr % 2 == 0) {
        answ += curr / 2;
      } else {
        bordyur[ci] = 1;
      }

      ci++;
    } else if(!used[i]) {
      dfs(i, node, curr + 1);
    } else if(used[i] == 2) {
      if(curr & 1) {

      }
    }
  }

  used[node] = 2;
}

void dfsCycle(int node, int parent) {
  used[node] = 1, p[node] = parent;
  for(auto i: adj[node]) {
    if(i == parent) continue;

    if(used[i] == 1) {
      int curr = node, cnt = 1;

      while(curr != i) {
        curr = p[curr];
        cnt++;
      }
      
      answ += cnt / 2;
      if(cnt & 1) {
        kent++;
      }
    } else if(!used[i]) {
      dfsCycle(i, node);
    }
  }

  used[node] = 2;
}

void solve_() {
  cin >> n, mp.reserve(2 * n);

  if(n & 1) {
    printf("-1\n");
    return;
  }

  for(int i = 1; i <= n; i++) {
    string a, b; cin >> a >> b;

    int ida, idb;

    if(mp.find(a) == mp.end()) {
      mp[a] = it++;
      ida = it - 1;
    } else {
      ida = mp[a];
    }

    if(mp.find(b) == mp.end()) {
      mp[b] = it++;
      idb = it - 1;
    } else {
      idb = mp[b];
    }

    adj[ida].push_back(idb);
    in[idb]++;
  }

  assert(it == n + 1);

  for(int i = 1; i <= n; i++) {
    if(!in[i]) {
      dfs(i, 0, 0);
    }
  }

  for(int i = 1; i <= n; i++) {
    if(!used[i]) {
      // cycles
      dfsCycle(i, 0);
    }
  }

  assert(kent % 2 == 0);
  answ += kent / 2;

  printf("%d\n", answ);
} 

int main() {
  setIO("");

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

polygon.cpp: In function 'void setIO(std::string)':
polygon.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
polygon.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2588 KB Output isn't correct
2 Halted 0 ms 0 KB -