oj.uz

답안 #896840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896840 2024-01-02T09:27:09 Z danikoynov 함박 스테이크 (JOI20_hamburg) C++14
2 / 100
 285 ms 108972 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 ++)
    {
        ///cout << events[i].type << " " << events[i].tim << endl;
        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 = 1e4 + 10;
pair < int, int > skew[maxs];
int m;
bitset < maxn > skew_set[maxs];

bool inside(pair < int, int > cur, rectangle rec)
{
    if (cur.first >= rec.A.x && cur.first <= rec.B.x &&
            cur.second >= rec.A.y && cur.second <= rec.B.y)
        return true;
    return false;
}

void match_pairs()
{
    ///cout << pos_x.size() << " : " << pos_y.size() << endl;
    for (int x : pos_x)
        for (int y : pos_y)
            skew[++ m] = {x, y};

    for (int i = 1; i <= m; i ++)
        for (int j = 1; j <= n; j ++)
            skew_set[i][j] = inside(skew[i], r[j]);

}

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

    if (k == 2)
    {
        ///cout << pos_x.size() << " : " << pos_y.size() << endl;
        for (int i = 1; i <= m; i ++)
            for (int j = i; j <= m; j ++)
            {
                if ((skew_set[i] | skew_set[j]).count() == n)
                {
                    cout << skew[i].first << " " << skew[i].second << endl;
                    cout << skew[j].first << " " << skew[j].second << endl;
                    return;
                }
            }

        ///assert(false);
    }
}
void solve()
{
    input();
    get_x();
    get_y();
    match_pairs();
    find_skewers();
}

int main()
{
    ///freopen("test.txt", "r", stdin);
    solve();
    return 0;
}

Compilation message

hamburg.cpp: In function 'void find_skewers()':
hamburg.cpp:162:57: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  162 |                 if ((skew_set[i] | skew_set[j]).count() == n)
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4184 KB Output is correct
2 Correct 4 ms 4188 KB Output is correct
3 Correct 4 ms 4188 KB Output is correct
4 Correct 4 ms 4188 KB Output is correct

Subtask #2
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 108972 KB Output is correct
2 Runtime error 12 ms 8284 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 14424 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 12380 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4184 KB Output is correct
2 Correct 4 ms 4188 KB Output is correct
3 Correct 4 ms 4188 KB Output is correct
4 Correct 4 ms 4188 KB Output is correct
5 Correct 281 ms 11444 KB Output is correct
6 Correct 285 ms 12448 KB Output is correct
7 Correct 280 ms 11508 KB Output is correct
8 Correct 283 ms 11436 KB Output is correct

Subtask #6
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 108972 KB Output is correct
2 Runtime error 12 ms 8284 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 14424 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 12380 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -