QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#717388#5426. Drain the Water TankXiaoYang3WA 0ms3592kbC++231.1kb2024-11-06 17:48:442024-11-06 17:48:46

Judging History

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

  • [2024-11-06 17:48:46]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3592kb
  • [2024-11-06 17:48:44]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll n, m, k, ans;
const int N = 4e6 + 5;
const int P = 1e9 + 7;
void solve() {
    cin >> n;
    vector<pii> ve(n + 2);
    vector<int> v(n + 2);
    for (int i = 0; i < n; i++) {
        cin >> ve[i].first >> ve[i].second;
    }
    for (int i = 0; i < n; i++) {
        int pre = (i + n - 1) % n;
        if (v[i]) {
            continue;
        }
        v[i] = 1;
        if (ve[pre].second < ve[i].second) {
            continue;
        }
        int j = (i + 1) % n;
        while (j != i && ve[i].second == ve[j].second) {
            j = (j + 1) % n;
            v[j] = 1;
        }
        if (ve[i].second > ve[j].second) {
            continue;
        }
        if (ve[i].first <= ve[j].first || ve[pre].first <= ve[i].first)
            ans++;
    }
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int _ = 1;
    // cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

详细

Test #1:

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

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: -100
Wrong Answer
time: 0ms
memory: 3580kb

input:

8
4 4
0 4
0 2
1 2
2 2
2 0
3 0
4 0

output:

2

result:

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