oj.uz

Submission #699134

# Submission time Handle Problem Language Result Execution time Memory
699134 2023-02-15T18:44:53 Z Ahmed57 Sticks (POI11_pat) C++14
84 / 100
 849 ms 64748 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    ordered_set s[n];
    vector<pair<int,int>> v;
    for(int i = 0;i<n;i++){
        int d;
        cin>>d;
        for(int j = 0;j<d;j++){
            int x;cin>>x;
            v.push_back({x,i});
            s[i].insert(x);
        }
    }
    sort(v.begin(),v.end());
    int b[n];
    for(int i = v.size()-1;i>=0;i--){
        b[v[i].second] = -1;
        for(int j = 0;j<n;j++){
            if(j==v[i].second)continue;
            int d = s[j].order_of_key(v[i].first+1);
            if(d>0){
                b[j]=*s[j].find_by_order(d-1);
            }else b[j] = -1;
        }
        int ma1 = -1 , ind1 = 0 , ma2 = -1 , ind2 = 0;
        for(int j = 0;j<n;j++){
            if(ma1<b[j]){
                ma1 = b[j];
                ind1 = j;
            }
        }
        if(ma1==-1)continue;
        for(int j = 0;j<n;j++){
            if(j==ind1)continue;
            if(ma2<b[j]){
                ma2 = b[j];
                ind2 = j;
            }
        }
        if(ma2==-1)continue;
        if(ma1+ma2<=v[i].first)continue;
        cout<<v[i].second+1<<" "<<v[i].first<<" "<<ind1+1<<" "<<ma1<<" "<<ind2+1<<" "<<ma2<<endl;
        return 0;
    }
    cout<<"NIE"<<endl;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Oczekiwano NIE

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Oczekiwano NIE
2 Correct 21 ms 2252 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Oczekiwano NIE
2 Correct 29 ms 2892 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Oczekiwano NIE
2 Correct 79 ms 6668 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1868 KB Oczekiwano NIE
2 Correct 161 ms 10228 KB Output is correct
3 Correct 89 ms 6636 KB Oczekiwano NIE

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 5008 KB Oczekiwano NIE
2 Correct 265 ms 18944 KB Output is correct
3 Correct 143 ms 10024 KB Oczekiwano NIE

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 32460 KB Output is correct
2 Correct 336 ms 20732 KB Output is correct
3 Correct 283 ms 15132 KB Oczekiwano NIE

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 32440 KB Output is correct
2 Correct 458 ms 23020 KB Output is correct
3 Correct 341 ms 19492 KB Oczekiwano NIE

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 849 ms 64748 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 687 ms 64660 KB Memory limit exceeded
2 Halted 0 ms 0 KB -