QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#686511#5426. Drain the Water Tankwangxiaorui#WA 0ms3696kbC++14694b2024-10-29 13:56:072024-10-29 13:56:13

Judging History

你现在查看的是最新测评结果

  • [2024-10-29 13:56:13]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3696kb
  • [2024-10-29 13:56:07]
  • 提交

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;
	}
	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-1+n)%n].y>=a[i].y&&a[i].y<a[(i+1)%n].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-1+n)%n].y>=a[i].y&&a[i].y<a[(i+1)%n].y) ans++;
	}
	cout<<ans;
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3568kb

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: 3636kb

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: 3624kb

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: 0
Accepted
time: 0ms
memory: 3556kb

input:

6
0 0
2 0
1 1
4 1
5 0
3 4

output:

2

result:

ok 1 number(s): "2"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3696kb

input:

8
0 0
1 0
3 -1
3 0
1 1
4 1
5 0
3 4

output:

2

result:

ok 1 number(s): "2"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

5
0 0
170 0
140 30
60 30
0 70

output:

1

result:

ok 1 number(s): "1"

Test #7:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

5
0 0
170 0
140 30
60 30
0 100

output:

1

result:

ok 1 number(s): "1"

Test #8:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

5
0 0
1 2
1 5
0 2
0 1

output:

1

result:

ok 1 number(s): "1"

Test #9:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

3
0 0
100 0
0 100

output:

1

result:

ok 1 number(s): "1"

Test #10:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

3
200 0
100 100
0 0

output:

1

result:

ok 1 number(s): "1"

Test #11:

score: 0
Accepted
time: 0ms
memory: 3556kb

input:

3
50 50
100 50
100 100

output:

1

result:

ok 1 number(s): "1"

Test #12:

score: 0
Accepted
time: 0ms
memory: 3564kb

input:

3
3 0
0 4
0 0

output:

1

result:

ok 1 number(s): "1"

Test #13:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

3
10000 10000
-10000 10000
10000 9999

output:

1

result:

ok 1 number(s): "1"

Test #14:

score: 0
Accepted
time: 0ms
memory: 3512kb

input:

3
10000 10000
-10000 10000
10000 9900

output:

1

result:

ok 1 number(s): "1"

Test #15:

score: 0
Accepted
time: 0ms
memory: 3696kb

input:

3
10000 10000
9999 10000
10000 -10000

output:

1

result:

ok 1 number(s): "1"

Test #16:

score: 0
Accepted
time: 0ms
memory: 3616kb

input:

3
0 0
200 0
100 173

output:

1

result:

ok 1 number(s): "1"

Test #17:

score: 0
Accepted
time: 0ms
memory: 3488kb

input:

3
0 0
200 0
100 1

output:

1

result:

ok 1 number(s): "1"

Test #18:

score: -100
Wrong Answer
time: 0ms
memory: 3512kb

input:

3
-10000 -10000
10000 9999
9999 10000

output:

0

result:

wrong answer 1st numbers differ - expected: '1', found: '0'