Submission #423672

#	Time	Username	Problem	Language	Result	Execution time	Memory
423672		aymane7	Izvanzemaljci (COI21_izvanzemaljci)	C++17	5 / 100	35 ms	3444 KiB

izvanzemaljci

#include<bits/stdc++.h>
#pragma GCC optimize("O2")
#define deb(x) cout << #x << " = " << x <<endl
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define all(c) c.begin(), c.end()
#define endl "\n"
#define sz(u) (int)(u.size())
#define L(x)(2*x)
#define R(x)(2*x+1)
#define M(x,y)((x+y)/2)
#define int long long
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int n,k;
vector<int> get(vector<pair<int,int>> pnt){
    int mnx=1e16,mny=1e16,mxx=-1e16,mxy=-1e16;
    for(int i=0;i<n;i++){
            mxx=max(mxx,pnt[i].F);
            mxy=max(mxy,pnt[i].S);
            mnx=min(mnx,pnt[i].F);
            mny=min(mny,pnt[i].S);
    }
    vector<int> ans={mnx,mny,max({mxx-mnx,mxy-mny,1LL})};
    return ans;
}
void solve(){
    cin>>n>>k;
    vector<pair<int,int>> pnt(n);
    for(auto &x:pnt)
        cin>>x.F>>x.S;
    if(k==1){
        vector<int> ans=get(pnt);
        for(auto x:ans)
            cout<<x<<" ";
        return ;
    }
    if(k==3){
        //for(int )
    }
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 21
• Subtask 3: 0 / 12
• Subtask 4: 0 / 30
• Subtask 5: 0 / 32