제출 #1135733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135733		iordache_	Sticks (POI11_pat)	C++20	84 / 100	280 ms	8080 KiB

pat

#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
const int MAXN=1e3+5;int INF=2e9,MOD=1e9+7;
signed main()
{
    int n;
    cin>>n;
    vector<int> sz(n);
    vector<vector<int>> v(n);
    //vector<pair<int,int>> mx;
    for(int i=0;i<n;++i)
    {
        cin>>sz[i];
        v[i].resize(sz[i]);
        for(auto &x:v[i]) cin>>x;
        sort(v[i].begin(),v[i].end());
        //mx.pb({v[i].back(),i});
    }
    //sort(mx.begin(),mx.end());
    for(int i=0;i<n;++i)
    {
        //luam sideul maxim ca v[i][0]
        //vector<int> cand;
        int best=-1,best2=-1,a=-1,b=-1;
        for(int j=0;j<n;++j)
        {
            if(j==i) continue;
            int val=-1;
            for(int k=0;k<sz[j];++k)
            {
                if(v[j][k]<=v[i][0])
                {
                    val=v[j][k];
                }
                else break;
            }
            if(val!=-1)
            {
                if(val>=best) best2=best,best=val,a=b,b=j;
                else if(val>best2) best2=val,a=j;
            }
        }
        if(best2!=-1&&best+best2>v[i][0])
        {
            cout<<i+1<<" "<<v[i][0]<<" "<<a+1<<" "<<best2<<" "<<b+1<<" "<<best;
            return 0;
        }
    }
    cout<<"NIE";
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 8 / 8
• Subtask 6: 8 / 8
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8
• Subtask 13: 8 / 8