oj.uz

Submission #328400

# Submission time Handle Problem Language Result Execution time Memory
328400 2020-11-16T12:01:10 Z egas Lightning Rod (NOI18_lightningrod) C++14
11 / 100
 1621 ms 262148 KB 
#include <bits/stdc++.h>






using namespace std;

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);


    long long n;
    cin >> n;
    vector<pair<long long,long long> > v;
    set<long long> ss;
    for(long long i = 0 ; i < n ; i++) {
        long long x;
        cin >> x;
        long long y;
        cin >> y;
        v.push_back({x,y});
        ss.insert(y);
        if(i>=1e6 and ss.size()==1 and (*ss.begin())==1 ) {
            cout << n << '\n';
            return 0;
        }
    }
    if(ss.size()==1 and (*ss.begin())==1 ) {
        cout << n << '\n';
        return 0;
    }
    if(n==2) {
        if(abs(v[1].second-v[0].second)>=abs(v[1].first-v[0].first)) {
            cout << 1 << '\n';
        } else {
            cout << 2 << '\n';
        }
    } else {

    }

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 16848 KB Output is correct
2 Correct 178 ms 16848 KB Output is correct
3 Correct 180 ms 16976 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Incorrect 0 ms 364 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Incorrect 0 ms 364 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Incorrect 0 ms 364 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1621 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 16848 KB Output is correct
2 Correct 178 ms 16848 KB Output is correct
3 Correct 180 ms 16976 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Incorrect 0 ms 364 KB Output isn't correct
12 Halted 0 ms 0 KB -