Submission #1141259

#	Time	Username	Problem	Language	Result	Execution time	Memory
1141259		rlx0090	새로운 문제 (POI11_pat)	C++20	0 / 100	199 ms	131072 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;
    int size = 0;
    for(int i = 0; i < k; ++i) {
        int n;
        cin >> n;
        size += n;
        for(int j = 0; j < n; ++j) {
            int x; cin >> x;
            g.push_back({x, i + 1});
        }
    }
    sort(g.rbegin(), g.rend());
    vector<int> len2idx(1000005, 0);
    vector<vector<int> > len2color(1000005, vector<int>(55, 0) );
    int idx = 0;
    for(int i = 0; i < size; ++i) {
        len2idx[idx] = g[i].first;
        len2color[idx][g[i].second] = 1;
        while(i < size && g[i].first == g[i + 1].first) {
            len2color[idx][g[i + 1].second] = 1;
            i++;
        }
        idx++;
    }

    for(int i = 0; i < size; ++i) {
        if(len2idx[i] == 0 || len2idx[i + 1] == 0 || len2idx[i + 2] == 0) break;
        if(len2idx[i] - len2idx[i + 1] < len2idx[i + 2]) {
            vector<int> a, b, c;
            for(int j = 1; j <= 50; ++j)
                if(len2color[i][j]) a.push_back(j);
            for(int j = 1; j <= 50; ++j)
                if(len2color[i + 1][j]) b.push_back(j);
            for(int j = 1; j <= 50; ++j)
                if(len2color[i + 2][j]) c.push_back(j);
            
            for(int p : a)
                for(int q : b)
                    for(int r : c)
                        if(p != q && p != r && q != r) {
                            cout << p << ' ' << len2idx[i] << ' ' << q << ' ' << len2idx[i + 1] << ' ' << r << ' ' << len2idx[i + 2];
                            exit(0);
                        }
        }        
    }
    cout << "NIE";
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 7
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8
• Subtask 13: 0 / 8