QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#693854 | #5426. Drain the Water Tank | 42m0rr0w | WA | 1ms | 7800kb | C++20 | 1.3kb | 2024-10-31 16:50:58 | 2024-10-31 16:51:03 |
Judging History
answer
#include <bits/stdc++.h>
#define test(x) cerr<<#x<<'='<<x<<endl
#define endl '\n'
#define int long long
#define PUT putchar('\n')
using namespace std;
const int MAXN = 1e6 + 100;
int n, m;
string s;
int a[MAXN], tot;
struct pt {
int x, y;
friend pt operator-(const pt &p1, const pt &p2) {
return {p1.x - p2.x, p1.y - p2.y};
}
friend pt operator+(const pt &p1, const pt &p2) {
return {p1.x + p2.x, p1.y + p2.y};
}
friend int operator^(const pt &p1, const pt &p2) {
return p1.x * p2.y - p1.y * p2.x;
}
friend int operator*(const pt &p1, const pt &p2) {
return p1.x * p2.x + p1.y * p2.y;
}
friend bool operator!=(const pt &p1, const pt &p2) {
return (p1.x != p2.x) || (p1.y != p2.y);
}
} p[MAXN], q[MAXN];
void cul() {
cin >> n;
tot = 0;
for (int i = 1; i <= n; ++i)
cin >> p[i].x >> p[i].y;
// for (int i = 1; i <= n; ++i)
// if(p[i+1].y != p[i].y)
p[++n] = p[1], p[++n] = p[2];
int ans = 0, f = 0;
pt id = {0, 0};
for (int i = 1; i <= n; ++i) {
pt u = p[i + 1] - p[i];
if (u.y < 0)
id = u;
else if (u.y == 0)
f = 1;
else if (u.y > 0) {
if ((id ^ u) > 0 || f == 1) {
++ans;
// test(i);
}
id = {0, 0};
f = 0;
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt = 1;
// cin >> tt;
while (tt--)
cul();
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 7800kb
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: 1ms
memory: 7664kb
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: 1ms
memory: 7736kb
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: 1ms
memory: 7716kb
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: 7736kb
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: -100
Wrong Answer
time: 1ms
memory: 7668kb
input:
5 0 0 170 0 140 30 60 30 0 70
output:
2
result:
wrong answer 1st numbers differ - expected: '1', found: '2'