QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #686569 | #5426. Drain the Water Tank | wangxiaorui# | WA | 0ms | 3696kb | C++14 | 821b | 2024-10-29 14:22:04 | 2024-10-29 14:22:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
struct node{
int x,y;
}a[2005];
int n,ans;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=0;i<n;i++) cin>>a[i].x>>a[i].y;
int p=0;
for(int i=1;i<n;i++)
{
if(a[i].y<a[p].y) p=i;
}
p=(p-1+n)%n;
int fl=1;
for(int i=p;i<n;i++)
{
if(a[i].x<a[(i-1+n)%n].x) fl=0;
if(a[i].x>a[(i-1+n)%n].x) fl=1;
if(fl&&a[(i-2+n)%n].y>=a[(i-1+n)%n].y&&a[(i-1+n)%n].y<a[i].y) ans++;
// cerr<<i<<' '<<fl<<' '<<ans<<endl;
}
for(int i=0;i<p;i++)
{
if(a[i].x<a[(i-1+n)%n].x) fl=0;
if(a[i].x>a[(i-1+n)%n].x) fl=1;
if(fl&&a[(i-2+n)%n].y>=a[(i-1+n)%n].y&&a[(i-1+n)%n].y<a[i].y) ans++;
}
cout<<ans;
return 0;
}
/*
15
1 4
2 1
3 0
4 2
5 1
7 8
8 0
10 5
8 10
6 8
5 10
1 10
4 8
4 4
2 7
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3692kb
input:
6 0 0 1 1 2 1 3 0 3 2 0 2
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3512kb
input:
8 4 4 0 4 0 2 1 2 2 2 2 0 3 0 4 0
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
7 1 0 3 4 0 3 1 2 2 3 1 1 0 2
output:
2
result:
ok 1 number(s): "2"
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3696kb
input:
6 0 0 2 0 1 1 4 1 5 0 3 4
output:
0
result:
wrong answer 1st numbers differ - expected: '2', found: '0'