Submission #619095

#TimeUsernameProblemLanguageResultExecution timeMemory
619095errayTriangles (CEOI18_tri)C++14
0 / 100
1 ms304 KiB
// author: erray
#include <bits/stdc++.h>

#include "trilib.h"

using namespace std;

#ifdef DEBUG
  #include "/home/eagle/debug.h"
#else
  #define debug(...) void(37)
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int N;
int query = 0;
int Ask(int a, int b, int c) {
  if (query += 1 == int(1E6) - 5) {
	assert(false);  
	assert(false);  
  }
  return is_clockwise(a + 1, b + 1, c + 1);
}

int main() {
  N = get_n();
  int ans = 0;
  for (int i = 0; i < N; ++i) {
    set<int> st;
    int x;
    do {
	  x = rng() % N;
	} while (x == i);
    for (int j = 0; j < N; ++j) {
	  if (j != x && j != i) {
	    st.insert(Ask(i, x, j));
	  }
	}
	if (int(st.size()) == 1) {
	  ans += 1;
	}
  } 
  cout << ans << '\n';
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...