oj.uz

Submission #830508

# Submission time Handle Problem Language Result Execution time Memory
830508 2023-08-19T07:25:25 Z vjudge1 Lightning Rod (NOI18_lightningrod) C++17
4 / 100
 1142 ms 156132 KB 
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int N;
    cin >> N;
    vector<int>X(N+1);
    vector<int>Y(N+1);
    int lirod=0;
    for(int i=1; i<=N; i++) {
        cin >> X[i] >> Y[i];
        if(i>1 && X[i]!=X[i-1]) lirod++;
    }
    cout << lirod+1 << endl;
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1119 ms 156132 KB Output is correct
2 Correct 1105 ms 155908 KB Output is correct
3 Correct 1074 ms 151312 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1142 ms 146136 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1119 ms 156132 KB Output is correct
2 Correct 1105 ms 155908 KB Output is correct
3 Correct 1074 ms 151312 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -