Submission #822957

#TimeUsernameProblemLanguageResultExecution timeMemory
822957MohamedAhmed04Triangles (CEOI18_tri)C++14
35 / 100
1811 ms320 KiB
#include "trilib.h" #include <bits/stdc++.h> using namespace std ; const int MAX = 50 + 10 ; mt19937 rng(2023) ; int N ; int main() { N = get_n() ; int ans = 0 ; vector<int>v ; for(int i = 1 ; i <= N ; ++i) { bool flag = false ; for(int j = 1 ; j <= N && (!flag) ; ++j) { v.clear() ; for(int k = 1 ; k <= N ; ++k) { if(i == j || i == k || j == k) continue ; v.push_back(k) ; } shuffle(v.begin() , v.end() , rng) ; flag = (i != j) ; for(auto &k : v) { if(!flag) break ; flag &= is_clockwise(i , j , k) ; } } ans += flag ; } give_answer(ans) ; return 0 ; }
#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...