oj.uz

Submission #699138

# Submission time Handle Problem Language Result Execution time Memory
699138 2023-02-15T18:54:58 Z Ahmed57 Sticks (POI11_pat) C++14
28 / 100
 221 ms 12864 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>
vector<int> s[50];int b[50];
vector<pair<int,int>> v;
int ma1 = -1 , ma2 = 0 , ind1 = 0 , ind2 = 0 , x = 0 , d = 0 , n;
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i = 0;i<n;i++){
        cin>>d;
        for(int j = 0;j<d;j++){
            cin>>x;
            v.push_back({x,i});
            s[i].push_back(x);
        }
    }
    sort(v.begin(),v.end());
    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 = lower_bound(s[j].begin(),s[j].end(),v[i].first+1)-s[j].begin();
            if(d>0){
                b[j]=s[j][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 1 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
7.0 / 7.0

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

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Oczekiwano NIE
2 Incorrect 8 ms 816 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Oczekiwano NIE
2 Incorrect 10 ms 1108 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Oczekiwano NIE
2 Incorrect 25 ms 1664 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 776 KB Oczekiwano NIE
2 Incorrect 48 ms 3092 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1744 KB Oczekiwano NIE
2 Incorrect 80 ms 5708 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 6576 KB Output is correct
2 Incorrect 117 ms 5548 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 6548 KB Output is correct
2 Incorrect 138 ms 5832 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 12796 KB Output is correct
2 Incorrect 135 ms 9292 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 12864 KB Output is correct
2 Incorrect 221 ms 10496 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -