Submission #1141323

#	Time	Username	Problem	Language	Result	Execution time	Memory
1141323		rlx0090	Sticks (POI11_pat)	C++20	92 / 100	527 ms	30336 KiB

pat

#include <iostream>
#include <vector>
#include <fstream>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <cfloat>
#include <random>
#include <complex>
#include<assert.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    int k;
    cin >> k;
    vector<pair<int, int> > g;
    for(int i = 0; i < k; ++i) {
        int n;
        cin >> n;
        set<int> q;
        for(int j = 0; j < n; ++j) {
            int x; cin >> x;
            if(q.count(x)) continue;
            q.insert(x);
            g.push_back({x, i + 1});
        }
    }
    sort(g.rbegin(), g.rend());
    
    int i1= 0, i2 = 1, i3 = 2;
    while(i2 < g.size() && g[i1].second == g[i2].second) i2++;
    i3 = i2 + 1;
    while(i3 < g.size() && (g[i1].second == g[i3].second || g[i2].second == g[i3].second)) i3++;
    
    for(int i = 0; i < g.size(); ++i) {
        if(g[i].second == g[i2].second) {
            int i4 = i3 + 1;
            while(i4 < g.size() && (g[i2].second == g[i4].second || g[i3].second == g[i4].second)) i4++;
            
            if(i4 == g.size()) break;
            
            i2 = i3;
            i3 = i4;
        }
        
        if(g[i].first < g[i2].first + g[i3].first) {
            cout << g[i].second << ' ' << g[i].first << ' ' << g[i2].second << ' ' << g[i2].first << ' ' << g[i3].second << ' ' << g[i3].first;
            exit(0);
        }
        
    }
    cout << "NIE";
}

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