oj.uz

Submission #492489

# Submission time Handle Problem Language Result Execution time Memory
492489 2021-12-07T14:46:30 Z LittleCube Roads (CEOI20_roads) C++14
0 / 100
 2 ms 332 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N;
pii p[200005];
vector<pii> v;
signed main()
{
    cin >> N;
    for (int i = 1; i <= N; i++)
    {
        cin >> p[2 * i - 1].F >> p[2 * i - 1].S >> p[2 * i].F >> p[2 * i].S;
        assert(p[2 * i - 1].F == p[2 * i].F);
    }
    for (int i = 1; i <= N; i++)
        v.emplace_back(max(p[2 * i - 1], p[2 * i]));
    sort(v.begin(), v.end());
    for (int i = 1; i < N; i++)
        cout << v[i - 1].F << " " << v[i - 1].S << " " << v[i].F << " " << v[i].S << '\n';
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Failed 2 ms 332 KB Condition failed: "!Cross(S[*pi], S[*pa])"
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Failed 2 ms 332 KB Condition failed: "!Cross(S[*pi], S[*pa])"
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Failed 2 ms 332 KB Condition failed: "!Cross(S[*pi], S[*pa])"
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -