oj.uz

Submission #1012765

# Submission time Handle Problem Language Result Execution time Memory
1012765 2024-07-02T14:54:24 Z Almonther Sticks (POI11_pat) C++
60 / 100
 134 ms 17232 KB 
#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++;
    while(1){
        if(arr[k].first==arr[j].first||arr[j].first==arr[i].first||arr[i].first==arr[k].first||i>=cnt||j>=cnt||k>=cnt){
            co "NIE";
            return;
        }
        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.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
7.0 / 7.0

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

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Oczekiwano NIE
2 Incorrect 4 ms 2648 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 344 KB Oczekiwano NIE
2 Incorrect 6 ms 2584 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 1 ms 348 KB Oczekiwano NIE
2 Incorrect 12 ms 2688 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 4 ms 2652 KB Oczekiwano NIE
2 Incorrect 19 ms 4744 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2652 KB Oczekiwano NIE
2 Correct 32 ms 4700 KB Output is correct
3 Correct 19 ms 5720 KB Oczekiwano NIE

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 8796 KB Output is correct
2 Incorrect 44 ms 9564 KB Expected integer, but "NIE" found
3 Halted 0 ms 0 KB -

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 8844 KB Output is correct
2 Correct 45 ms 9816 KB Output is correct
3 Correct 38 ms 9048 KB Oczekiwano NIE

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 17012 KB Output is correct
2 Correct 51 ms 12388 KB Output is correct
3 Correct 57 ms 12264 KB Oczekiwano NIE

Subtask #13
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 17232 KB Output is correct
2 Correct 61 ms 12880 KB Output is correct
3 Correct 67 ms 12924 KB Oczekiwano NIE