oj.uz

답안 #289893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
289893 2020-09-03T08:05:07 Z 최은수(#5769) 함박 스테이크 (JOI20_hamburg) C++17
9 / 100
 109 ms 9916 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
inline bool check(const pair<pi,pi>&sq,const pi&p)
{
    return sq.fi.fi<=p.fi&&p.fi<=sq.fi.se&&sq.se.fi<=p.se&&p.se<=sq.se.se;
}
inline pair<pi,pi>check(const vector<pair<pi,pi> >&v)
{
    int xmx=-inf,xmn=inf,ymx=-inf,ymn=inf;
    for(auto&t:v)
        xmx=max(xmx,t.fi.fi),ymx=max(ymx,t.se.fi),
        xmn=min(xmn,t.fi.se),ymn=min(ymn,t.se.se);
    pi p[4]={pi(xmx,ymx),pi(xmx,ymn),pi(xmn,ymx),pi(xmn,ymn)};
    for(int i=0;i<4;i++)
    {
        for(int j=i+1;j<4;j++)
        {
            bool f=1;
            for(auto&t:v)
            {
                if(!check(t,p[i])&&!check(t,p[j]))
                {
                    f=0;
                    break;
                }
            }
            if(f)
                return pair<pi,pi>(p[i],p[j]);
        }
    }
    return pair<pi,pi>(pi(-1,-1),pi(-1,-1));
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,k;
    cin>>n>>k;
    vector<pair<pi,pi> >v(n);
    for(auto&t:v)
        cin>>t.fi.fi>>t.se.fi>>t.fi.se>>t.se.se;
    int xmx=-inf,xmn=inf,ymx=-inf,ymn=inf;
    for(auto&t:v)
        xmx=max(xmx,t.fi.fi),ymx=max(ymx,t.se.fi),
        xmn=min(xmn,t.fi.se),ymn=min(ymn,t.se.se);
    vector<pi>pv({pi(xmx,ymx),pi(xmx,ymn),pi(xmn,ymx),pi(xmn,ymn)});
    for(pi&p:pv)
    {
        vector<pair<pi,pi> >nxv;
        for(auto&t:v)
            if(!check(t,p))
                nxv.eb(t);
        auto get=check(nxv);
        if(get.fi.fi!=-1)
            return cout<<p.fi<<' '<<p.se<<endl,
            cout<<get.fi.fi<<' '<<get.fi.se<<endl,
            cout<<get.se.fi<<' '<<get.se.se<<endl,0;
    }
    return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #2
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

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

Subtask #4
0 / 6.0

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

Subtask #5
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #6
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 95 ms 5700 KB Output is correct
14 Correct 97 ms 5616 KB Output is correct
15 Correct 94 ms 5616 KB Output is correct
16 Correct 96 ms 5616 KB Output is correct
17 Correct 100 ms 5616 KB Output is correct
18 Correct 95 ms 4596 KB Output is correct
19 Correct 96 ms 7788 KB Output is correct
20 Correct 109 ms 9916 KB Output is correct
21 Correct 97 ms 7664 KB Output is correct
22 Correct 100 ms 7660 KB Output is correct
23 Correct 102 ms 7660 KB Output is correct
24 Correct 103 ms 7660 KB Output is correct

Subtask #8
0 / 79.0

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