Submission #202792

#	Time	Username	Problem	Language	Result	Execution time	Memory
202792		galen_colin	Friend (IOI14_friend)	C++14	0 / 100	5 ms	380 KiB

friend

#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
// template<typename A, typename B> ll max(A x, B y) {
//   return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
//   return x < y ? x : y;
// }
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;

// namespace interactor {
  
// }

// using namespace interactor;

// int findSample(int n, int conf[], int host[], int protocol[]);

// int main() {
//   int conf[6] = {1, 1, 1, 1, 1, 1};
//   int host[6] = {0, 0, 1, 1, 1, 0};
//   int prot[6] = {0, 0, 0, 0, 0, 0};
//   f0r(tc, 30000) {
//     int n = 1000;
//     int conf[n];
//     int zcol[n];
//     ms(zcol, 0);
//     f0r(i, n) conf[i] = 1;
//     int host[n];
//     int cc = 0;
//     f1r(i, 1, n) {
//       host[i] = rng() % i;
//       zcol[i] = !zcol[host[i]];
//       cc += zcol[i];
//     }
//     int prot[n];
//     ms(prot, 0);
//     int x = max(cc, n - cc);
//     cout << cc << " " << n - cc << endl;
//     int y = findSample(n, conf, host, prot);
//     cout << y << endl;
//     if (x != y) {
//       ao(zcol, n);
//       ao(conf, n);
//       ao(host, n);
//       ao(prot, n);
//       break;
//     }
//   }
//   cout << findSample(5, conf, host, prot) << endl;
// }

#include "friend.h"
 
ll n, m, k, q, Q, T, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

vi edges[1005];
bool vis[1005];

pii cnt;

void bicolor(int x, int c) {
  if (vis[x]) return;
  vis[x] = 1;

  ++cnt.f;
  if (c == 1) ++cnt.s;

  for (int y: edges[x]) {
    if (!vis[y]) {
      bicolor(y, !c);
    }
  }
}

int findSample(int n, int conf[], int host[], int prot[]) {
  for (int i = 1; i < n; i++) {
    if (prot[i] == 0) {
      edges[host[i]].pb(i);
      edges[i].pb(host[i]);
    } else {
      for (int x: edges[host[i]]) {
        edges[i].pb(x);
        edges[x].pb(i);
      }
    }
  }

  ms(vis, 0);
  int ans = 0;
  f0r(i, n) {
    if (!vis[i]) {
      cnt = mp(0, 0);
      bicolor(i, 0);
      if (cnt.s > cnt.f - cnt.s) ans += cnt.s;
      else ans += cnt.f - cnt.s;
    }
  }

  return ans;
}
 
// int main() {
//   io;
//   // freopen("case", "r", stdin);
//   // freopen("test.txt", "r", stdin);
//   // freopen("case", "w", stdout);
//   // freopen("file.in", "r", stdin);
 
//   // usaco("file");
 
  
// } 

Compilation message (stderr)

friend.cpp: In function 'void usaco(std::__cxx11::string)':
friend.cpp:65:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".in").c_str(), "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
friend.cpp:66:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".out").c_str(), "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31