oj.uz

Submission #896829

# Submission time Handle Problem Language Result Execution time Memory
896829 2024-01-02T09:14:14 Z danikoynov Hamburg Steak (JOI20_hamburg) C++14
2 / 100
 306 ms 19396 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 2e5 + 10;
struct event
{
    int tim, type;

    event(int _tim = 0, int _type = 0)
    {
        tim = _tim;
        type = _type;
    }

    bool operator < (const event &e) const
    {
        if (tim != e.tim)
            return tim < e.tim;
        return type > e.type;
    }

};

struct point
{
    int x, y;

    point(int _x = 0, int _y = 0)
    {
        x = _x;
        y = _y;
    }

    void input()
    {
        cin >> x >> y;
    }
};

struct rectangle
{
    point A, B;

    rectangle()
    {
        A = point();
        B = point();
    }
    void input()
    {
        A.input();
        B.input();
    }
}r[maxn];

int n, k;
void input()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i ++)
        r[i].input();
}

vector < int > pos_x, pos_y;
void get_x()
{
    vector < event > events;
    for (int i = 1; i <= n; i ++)
    {
        events.push_back(event(r[i].A.x, 1));
        events.push_back(event(r[i].B.x, -1));
    }

    sort(events.begin(), events.end());

    for (int i = 0; i < 2 * n; i ++)
    {
        if (events[i].type == 1 && events[i + 1].type == -1)
            pos_x.push_back(events[i].tim);
    }
}

void get_y()
{
    vector < event > events;
    for (int i = 1; i <= n; i ++)
    {
        events.push_back(event(r[i].A.y, 1));
        events.push_back(event(r[i].B.y, -1));
    }

    sort(events.begin(), events.end());

    for (int i = 0; i < 2 * n; i ++)
    {
        if (events[i].type == 1 && events[i + 1].type == -1)
            pos_y.push_back(events[i].tim);
    }
}
const int maxk = 5;

const int maxs = maxk * maxk;
 pair < int, int > skew[maxs];
 int m;
void match_pairs()
{
    for (int x : pos_x)
        for (int y : pos_y)
    {
        skew[++ m] = {x, y};
    }
}

void find_skewers()
{
    if (k == 1)
    {
        assert(m == 1);
        cout << skew[1].first << " " << skew[1].second << endl;
        return;
    }
}
void solve()
{
    input();
    get_x();
    get_y();
    match_pairs();
    find_skewers();
}

int main()
{
    solve();
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3676 KB Output is correct
2 Correct 4 ms 3676 KB Output is correct
3 Correct 4 ms 3676 KB Output is correct
4 Correct 4 ms 3676 KB Output is correct

Subtask #2
0 / 1.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 7004 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 8 ms 6972 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

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

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3676 KB Output is correct
2 Correct 4 ms 3676 KB Output is correct
3 Correct 4 ms 3676 KB Output is correct
4 Correct 4 ms 3676 KB Output is correct
5 Correct 288 ms 18384 KB Output is correct
6 Correct 296 ms 18660 KB Output is correct
7 Correct 289 ms 19396 KB Output is correct
8 Correct 306 ms 19252 KB Output is correct

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 7004 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 8 ms 6972 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 79.0

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