oj.uz

답안 #824448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824448 2023-08-14T06:28:21 Z kebine Lightning Rod (NOI18_lightningrod) C++17
4 / 100
 1328 ms 262144 KB 
# include <bits/stdc++.h>
# define int long long
# define vi vector<int>
# define pb push_back
# define pii pair<int, int>
# define fi first
# define se second
# define endl '\n'
# define jess ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

int n, x[10000005], y[10000005];
set<pii> s;

void solve() {
    cin >> n;
    bool ok=1;
    int mx=0, mn=1e9;
    for(int i=1; i<=n; i++) {
        cin >> x[i] >> y[i];
        if(y[i]!=1) ok=0;
        mx=max(mx, y[i]);
        mn=min(mn, y[i]);
    }
    if(ok) {
        cout << n << endl;
        return;
    }
    if((mx-mn)<=1) {
        int cnt=0;
        for(int i=1; i<=n; i++) {
            if(y[i]==1) cnt++;
            else {
                if(y[i-1]!=1 && y[i+1]!=1) cnt++;
            }
        }
        cout << cnt << endl;
    }
    for(int i=1; i<=n; i++) {
        s.insert({y[i], x[i]});
    }
    int ans=0;
    while(!s.empty()) {
        pii cur=*s.rbegin();
        ans++;
        vector<pii> v;
        for(pii i : s) {
            if(abs(i.se-cur.se)<=(cur.fi-i.fi)) {
                v.pb(i);
            }
        }
        for(pii i : v) s.erase(i);
    }
    cout << ans << endl;
}
 
signed main() {
    jess;
    solve();
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1142 ms 151956 KB Output is correct
2 Correct 1103 ms 151584 KB Output is correct
3 Correct 1106 ms 147516 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1328 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1142 ms 151956 KB Output is correct
2 Correct 1103 ms 151584 KB Output is correct
3 Correct 1106 ms 147516 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -