oj.uz

Submission #757969

# Submission time Handle Problem Language Result Execution time Memory
757969 2023-06-14T03:15:15 Z gelov Towers (NOI22_towers) C++17
5 / 100
 160 ms 8148 KB 
#include<bits/stdc++.h>
using namespace std;

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

    int n;
    cin >> n;

    vector<tuple<int, int>> a(n);

    for (int i = 0; i < n; i++) {
        cin >> get<0>(a[i]) >> get<1>(a[i]);
    }

    if (n <= 3) {
        int x1 = get<0>(a[0]);
        int x2 = get<0>(a[1]);
        int x3 = get<0>(a[2]);
        int y1 = get<1>(a[0]);
        int y2 = get<1>(a[1]);
        int y3 = get<1>(a[2]);
        if (x1 == x2 && x2 == x3) {
            int mx = max(y1, y2);
            mx = max(mx, y3);
            int mn = min(y1, y2);
            mn = min(mn, y3);
            for (int i = 0; i < n; i++) {
                if (get<1>(a[i]) == mx || get<1>(a[i]) == mn) {
                    cout << 1;
                }
                else {
                    cout << 0;
                }
            }
        }
        else if (y1 == y2 && y2 == y3) {
            int mx = max(x1, x2);
            mx = max(mx, x3);
            int mn = min(x1, x2);
            mn = min(mn, x3);
            for (int i = 0; i < n; i++) {
                if (get<0>(a[i]) == mx || get<0>(a[i]) == mn) {
                    cout << 1;
                }
                else {
                    cout << 0;
                }
            }
        }
        else {
            for (int i = 0; i < n; i++) {
                cout << 1;
            }
        }
        cout << "\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 0 ms 212 KB Unexpected end of file - token expected
12 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 980 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 160 ms 8148 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 0 ms 212 KB Unexpected end of file - token expected
12 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 0 ms 212 KB Unexpected end of file - token expected
12 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 0 ms 212 KB Unexpected end of file - token expected
12 Halted 0 ms 0 KB -