| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 746532 | vjudge1 | Triangles (CEOI18_tri) | C++17 | 1 ms | 468 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"
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n=get_n();
vector<int>unnow;
if(is_clockwise(1,2,3)){
unnow.push_back(1);
unnow.push_back(2);
unnow.push_back(3);
}
else{
unnow.push_back(1);
unnow.push_back(3);
unnow.push_back(2);
}
for(int i=4;i<=n;i++){
vector<int>ted((int)unnow.size()+1);
int f=0;
if(!is_clockwise(unnow.back(),unnow[0],i)){
ted[(int)unnow.size()-1]++;
ted[0]++;
f=1;
}
for(int i=0;i<(int)unnow.size()-1;i++){
if(!is_clockwise(unnow[i],unnow[i+1],i)){
ted[i]++;
ted[i+1]++;
f=1;
}
}
if(f==0){
continue;
}
vector<int>fake;
int z=0;
for(int i=0;i<(int)unnow.size();i++){
if(ted[i]==2){
continue;
}
if(ted[i]==0){
fake.push_back(unnow[i]);
continue;
}
fake.push_back(unnow[i]);
if(i==(int)unnow.size()-1||ted[i+1]!=0){
fake.push_back(i);
}
}
swap(fake,unnow);
fake.clear();
}
give_answer((int)unnow.size());
}Compilation message (stderr)
| # | 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... | ||||
