# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291476 | groeneprof | Triangles (CEOI18_tri) | C++14 | 37 ms | 2352 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "trilib.h"
#define P(a) do{if(debug) cout<<a<<endl;} while(false)
#define H(a) P(#a<<": "<<a)
#define FR(i,a,b) for(int i = (a); i<(b); i++)
#define F(i,n) FR(i,0,n)
const int debug = 0;
using namespace std;
bool comp(int a, int b){
return is_clockwise(1,a,b);
}
int n;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
n = get_n();
vector<int> v1 = {2},v2;
for(int i = 3; i<=n; i++){
if(is_clockwise(1,2,i)){
v1.push_back(i);
}
else{
v2.push_back(i);
}
}
P("aaaaaaaa");
sort(v1.begin(),v1.end(),comp);
P("a");
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |