Submission #1333489

#	Time	Username	Problem	Language	Result	Execution time	Memory
1333489		adriines06	Sticks (POI11_pat)	C++20	92 / 100	309 ms	8612 KiB

pat

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
    ll n; cin>>n;
    vector<vector<ll>>mt(n);
    for(ll i=0;i<n;i++){
        ll m; cin>>m;
        vector<ll>v(m);
        for(ll &x: v) cin>>x;
        sort(v.begin(),v.end());
        mt[i]=v;
    }
    for(ll i=0;i<n;i++){
        for(ll j=i+1;j<n;j++){
            for(ll k=j+1;k<n;k++){
                ll a=0,b=0;
                while(a<mt[i].size() && b<mt[j].size()){
                    ll dif=abs(mt[i][a]-mt[j][b]);
                    auto c=upper_bound(mt[k].begin(),mt[k].end(),dif);
                    if(c!=mt[k].end() && *c<mt[i][a]+mt[j][b]){
                        cout<<i+1<<" "<<mt[i][a]<<" "<<j+1<<" "<<mt[j][b]<<" "<<k+1<<" "<<*c;
                        return;
                    }
                    if(mt[i][a]<mt[j][b]) a++;
                    else b++;
                }
            }
        }
    }
    cout<<"NIE";
    

}
int main(){
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    solve();
    return 0;
}

• 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: 8 / 8
• Subtask 12: 0 / 8
• Subtask 13: 8 / 8