oj.uz

답안 #787534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787534 2023-07-19T09:19:53 Z 반딧불(#10031) 함박 스테이크 (JOI20_hamburg) C++17
15 / 100
 265 ms 11568 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void input();
bool check1();
bool check2();
bool check3();
bool check4();
void output();

int main(){
    input();
    if(!check1()) if(!check2()) if(!check3()) check4();
    output();
}

int n, k;
vector<int> xCoord(1), yCoord(1);
int L[200002], R[200002], D[200002], U[200002], X, Y;
vector<pair<int, int> > ans;

void input(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<=n; i++){
        scanf("%d %d %d %d", &L[i], &D[i], &R[i], &U[i]);
        xCoord.push_back(L[i]); xCoord.push_back(R[i]);
        yCoord.push_back(D[i]); yCoord.push_back(U[i]);
    }
    sort(xCoord.begin(), xCoord.end()); xCoord.erase(unique(xCoord.begin(), xCoord.end()), xCoord.end());
    sort(yCoord.begin(), yCoord.end()); yCoord.erase(unique(yCoord.begin(), yCoord.end()), yCoord.end());
    for(int i=1; i<=n; i++){
        L[i] = lower_bound(xCoord.begin(), xCoord.end(), L[i]) - xCoord.begin();
        R[i] = lower_bound(xCoord.begin(), xCoord.end(), R[i]) - xCoord.begin();
        D[i] = lower_bound(yCoord.begin(), yCoord.end(), D[i]) - yCoord.begin();
        U[i] = lower_bound(yCoord.begin(), yCoord.end(), U[i]) - yCoord.begin();
    }
    X = (int)xCoord.size()-1, Y = (int)yCoord.size()-1;
}

bool check1(){
    int maxX = 0, maxY = 0;
    for(int i=1; i<=n; i++) maxX = max(maxX, L[i]), maxY = max(maxY, D[i]);
    for(int i=1; i<=n; i++){
        if(maxX > R[i] || maxY > U[i]) return false;
    }
    ans.push_back(make_pair(maxX, maxY));
    return true;
}

struct namespace2{
    bool tryWith(int x, int y){
        int maxL = 1, maxD = 1, minR = X, minU = Y;
        for(int i=1; i<=n; i++){
            if(L[i] <= x && x <= R[i] && D[i] <= y && y <= U[i]) continue;
            maxL = max(maxL, L[i]), maxD = max(maxD, D[i]);
            minR = min(minR, R[i]), minU = min(minU, U[i]);
        }
        if(maxL <= minR && maxD <= minU){
            ans.push_back(make_pair(x, y));
            ans.push_back(make_pair(maxL, maxD));
            return true;
        }
        return false;
    }

    bool check2(){
        int maxL = *max_element(L+1, L+n+1);
        int minR = *min_element(R+1, R+n+1);
        int maxD = *max_element(D+1, D+n+1);
        int minU = *min_element(U+1, U+n+1);
        if(tryWith(maxL, maxD)) return true;
        if(tryWith(maxL, minU)) return true;
        if(tryWith(minR, maxD)) return true;
        if(tryWith(minR, minU)) return true;
        return false;
    }
} p2;

bool check2(){
    return p2.check2();
}

struct namespace3{
    bool check2(int n, vector<int> &L, vector<int> &R, vector<int> &D, vector<int> &U, int px, int py){
        int maxL = *max_element(L.begin(), L.end());
        int minR = *min_element(R.begin(), R.end());
        int maxD = *max_element(D.begin(), D.end());
        int minU = *min_element(U.begin(), U.end());
        int Xd[2] = {maxL, minR}, Yd[2] = {maxD, minU};
        for(int a: Xd) for(int b: Yd){
            int maxL = 1, maxD = 1, minR = X, minU = Y;
            for(int i=0; i<n; i++){
                if(L[i] <= a && a <= R[i] && D[i] <= b && b <= U[i]) continue;
                maxL = max(maxL, L[i]), maxD = max(maxD, D[i]);
                minR = min(minR, R[i]), minU = min(minU, U[i]);
            }
            if(maxL <= minR && maxD <= minU){
                ans.push_back(make_pair(px, py));
                ans.push_back(make_pair(a, b));
                ans.push_back(make_pair(maxL, maxD));
                return true;
            }
        }
        return false;
    }

    bool tryWith(int x, int y){
        vector<int> _L,_R,_D,_U;
        for(int i=1; i<=n; i++){
            if(L[i]<=x && x<=R[i] && D[i]<=y && y<=U[i]) continue;
            else _L.push_back(L[i]), _R.push_back(R[i]), _D.push_back(D[i]), _U.push_back(U[i]);
        }
        return check2((int)_L.size(),_L,_R,_D,_U,x,y);
    }

    bool check3(){
        int maxL = *max_element(L+1, L+n+1);
        int minR = *min_element(R+1, R+n+1);
        int maxD = *max_element(D+1, D+n+1);
        int minU = *min_element(U+1, U+n+1);
        if(tryWith(maxL, maxD)) return true;
        if(tryWith(maxL, minU)) return true;
        if(tryWith(minR, maxD)) return true;
        if(tryWith(minR, minU)) return true;
        return false;
    }

    bool tryWith(int x, int y, vector<int> &L, vector<int> &R, vector<int> &D, vector<int> &U, int px, int py){
        vector<int> _L,_R,_D,_U;
        for(int i=0; i<(int)L.size(); i++){
            if(L[i]<=x && x<=R[i] && D[i]<=y && y<=U[i]) continue;
            else _L.push_back(L[i]), _R.push_back(R[i]), _D.push_back(D[i]), _U.push_back(U[i]);
        }
        if(check2((int)_L.size(),_L,_R,_D,_U,x,y)){
            ans.push_back(make_pair(px, py));
            return true;
        }
        else return false;
    }

    bool check3(int n, vector<int> &L, vector<int> &R, vector<int> &D, vector<int> &U, int px, int py){
        int maxL = *max_element(L.begin(), L.end());
        int minR = *min_element(R.begin(), R.end());
        int maxD = *max_element(D.begin(), D.end());
        int minU = *min_element(U.begin(), U.end());
        if(tryWith(maxL, maxD, L, R, D, U, px, py)) return true;
        if(tryWith(maxL, minU, L, R, D, U, px, py)) return true;
        if(tryWith(minR, maxD, L, R, D, U, px, py)) return true;
        if(tryWith(minR, minU, L, R, D, U, px, py)) return true;
        return false;
    }
} p3;

bool check3(){
    return p3.check3();
}

struct namespace4{
    bool tryWith(int x, int y){
        vector<int> _L,_R,_D,_U;
        for(int i=1; i<=n; i++){
            if(L[i]<=x && x<=R[i] && D[i]<=y && y<=U[i]) continue;
            else _L.push_back(L[i]), _R.push_back(R[i]), _D.push_back(D[i]), _U.push_back(U[i]);
        }
        return p3.check3((int)_L.size(),_L,_R,_D,_U,x,y);
    }

    bool check4(){
        int maxL = *max_element(L+1, L+n+1);
        int minR = *min_element(R+1, R+n+1);
        int maxD = *max_element(D+1, D+n+1);
        int minU = *min_element(U+1, U+n+1);
        if(tryWith(maxL, maxD)) return true;
        if(tryWith(maxL, minU)) return true;
        if(tryWith(minR, maxD)) return true;
        if(tryWith(minR, minU)) return true;

        /// ���⼭���ʹ� �� ���� ��谡 ������ ���
        int l = minR, r = maxL, u = maxD, d = minU;
        assert(r - l >= 2 && u - d >= 2);

        int al = l+1, ar = r-1, cl = l+1, cr = r-1;
        int bl = d+1, br = u-1, dl = d+1, dr = u-1;
        int acl = al, acr = ar, bdl = bl, bdr = br;
        vector<pair<int, int> > ab, bc, cd, da;

        for(int i=1; i<=n; i++){
            int meetA = D[i] <= d && d <= U[i] && !(R[i] <= l || r <= L[i]);
            int meetB = L[i] <= l && l <= R[i] && !(U[i] <= d || u <= D[i]);
            int meetC = D[i] <= u && u <= U[i] && !(R[i] <= l || r <= R[i]);
            int meetD = L[i] <= r && r <= R[i] && !(U[i] <= d || u <= D[i]);
            int meetSum = meetA+meetB+meetC+meetD;

            if(meetSum == 0) while(1) puts("1");
            else if(meetSum == 1){
                if(meetA) al = max(al, L[i]), ar = min(ar, R[i]);
                if(meetB) bl = max(bl, D[i]), br = min(br, U[i]);
                if(meetC) cl = max(cl, L[i]), cr = min(cr, R[i]);
                if(meetD) dl = max(dl, D[i]), dr = min(dr, U[i]);
            }
            else if(meetSum == 2){
                if(meetA&&meetC) acl = max(acl, L[i]), acr = min(acr, R[i]);
                if(meetB&&meetD) bdl = max(bdl, D[i]), bdr = min(bdr, U[i]);
                if(meetA&&meetB) ab.push_back(make_pair(R[i], U[i]));
                if(meetC&&meetB) bc.push_back(make_pair(R[i], D[i]));
                if(meetC&&meetD) cd.push_back(make_pair(L[i], D[i]));
                if(meetA&&meetD) da.push_back(make_pair(L[i], U[i]));
            }
        }

        vector<int> aMaxB (X+2, Y), aMaxD (X+2, Y), cMinB (X+2, 1), cMinD (X+2, 1);
        for(pair<int, int> p: ab) aMaxB[p.first+1] = min(aMaxB[p.first+1], p.second);
        for(pair<int, int> p: da) aMaxD[p.first+1] = min(aMaxD[p.first+1], p.second);
        for(pair<int, int> p: bc) cMinB[p.first+1] = max(cMinB[p.first+1], p.second);
        for(pair<int, int> p: cd) cMinD[p.first+1] = max(cMinD[p.first+1], p.second);
        for(int i=l; i<=r; i++) aMaxB[i] = min(aMaxB[i], aMaxB[i-1]), cMinB[i] = max(cMinB[i], cMinB[i-1]);
        for(int i=r; i>=l; i--) aMaxD[i] = min(aMaxD[i], aMaxD[i+1]), cMinD[i] = max(cMinD[i], cMinD[i+1]);

        for(int a=l+1; a<r; a++) for(int c=l+1; c<r; c++){
            if((a<acl || a>acr) && (c<acl || c>acr)) continue;
            int bs = max(bl, cMinB[c]), be = min(br, aMaxB[a]);
            int ds = max(dl, cMinD[c]), de = min(dr, aMaxD[a]);
            if(bs <= be && ds <= de){
                int bans = -1, dans = -1;
                if(!(be < bdl && bdr < bs)) bans = max(bs, bdl), dans = ds;
                else if(!(de < bdl && bdr < ds)) dans = max(ds, bdl), bans = bs;
                else continue;
                assert(bans != -1 && dans != -1);
                assert(tryWith(l, bans));
                return true;
            }
        }

        return false;
    }
} p4;

bool check4(){
    return p4.check4();
}

void output(){
    if(ans.empty()) exit(1);
    while((int)ans.size() < k) ans.push_back(ans.back());
    for(auto p: ans) printf("%d %d\n", xCoord[p.first], yCoord[p.second]);
}

Compilation message

hamburg.cpp: In function 'void input()':
hamburg.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
hamburg.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         scanf("%d %d %d %d", &L[i], &D[i], &R[i], &U[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

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

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Runtime error 6 ms 468 KB Execution failed because the return code was nonzero
15 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 236 ms 6776 KB Output is correct
6 Correct 234 ms 6760 KB Output is correct
7 Correct 230 ms 6680 KB Output is correct
8 Correct 241 ms 6680 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 235 ms 6700 KB Output is correct
6 Correct 234 ms 6772 KB Output is correct
7 Correct 237 ms 6700 KB Output is correct
8 Correct 236 ms 6752 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 242 ms 9304 KB Output is correct
14 Correct 246 ms 9552 KB Output is correct
15 Correct 241 ms 9464 KB Output is correct
16 Correct 241 ms 8876 KB Output is correct
17 Correct 248 ms 9500 KB Output is correct
18 Correct 249 ms 8168 KB Output is correct
19 Correct 252 ms 11172 KB Output is correct
20 Correct 265 ms 11568 KB Output is correct
21 Correct 240 ms 11188 KB Output is correct
22 Correct 254 ms 11544 KB Output is correct
23 Correct 264 ms 11508 KB Output is correct
24 Correct 253 ms 11240 KB Output is correct

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Runtime error 6 ms 468 KB Execution failed because the return code was nonzero
15 Halted 0 ms 0 KB -