Submission #1012769

#	Time	Username	Problem	Language	Result	Execution time	Memory
1012769		Almonther	Sticks (POI11_pat)	C++98	60 / 100	147 ms	25680 KiB

pat

#include <bits/stdc++.h>

#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
ll n;
pair<ll,ll>arr[3000001];
ll cnt=0;
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        ll x;
        cin>>x;
        for(int j=0;j<x;j++){
            ll y;
            cin>>y;
            arr[cnt]={y,i};
            cnt++;
        }
    }
    sort(arr,arr+cnt);
    for(int i=0;i<cnt;i++) swap(arr[i].first,arr[i].second);
    ll i,j,k;
    j=k=0;
    while(arr[k].first==arr[j].first&&j<cnt) j++;
    i=j;
    while((arr[j].first==arr[i].first||arr[i].first==arr[k].first)&&i<cnt) i++;
    if(i>=cnt||j>=cnt||k>=cnt){
        co "NIE";
        return;
    }
    while(1){
        ll a,b,c;
        a=arr[i].second;
        b=arr[j].second;
        c=arr[k].second;
        if(a+b>c&&a+c>b&&c+b>a){
            co arr[i].first<<' '<<a<<' '<<arr[j].first<<' '<<b<<' '<<arr[k].first<<' '<<c;
            return;
        }
        if(i+1>=cnt) break;
        if(arr[i].first==arr[i+1].first){
            i++;
        }
        else{
            if(arr[i+1].first==arr[j].first){
                j=i;
                i++;
            }
            else{
                k=j;
                j=i;
                i++;
            }
        }
    }
    co "NIE";
}

int main()
{
    suiii
    int tt=1;
    // cin>>tt;
    while(tt--){
        solve();
    }
    return 0;
}

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