Submission #1135913

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135913		MateiKing80	Sticks (POI11_pat)	C++20	100 / 100	126 ms	4364 KiB

pat

#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int k;
    cin >> k;

    vector<vector<int>> arr(k + 1);
    for(int i = 1; i <= k; i ++)
    {
        int num;
        cin >> num;

        arr[i].resize(num + 1);
        for(int j = 1; j <= num; j ++)
            cin >> arr[i][j];

        sort(next(arr[i].begin()), arr[i].end());
    }

    for(int col = 1; col <= k; col ++)
    {
        for(auto it : arr[col])
        {
            int mx1 = 0, mx2 = 0;
            int c1, c2;
            for(int i = 1; i <= k; i ++)
            {
                if(i != col)
                {
                    auto cur = upper_bound(arr[i].begin(), arr[i].end(), it) - arr[i].begin() - 1;
                    if(cur > 0)
                    {
                        if(mx1 <= arr[i][cur])
                        {
                            mx2 = mx1, c2 = c1;
                            mx1 = arr[i][cur], c1 = i;
                        }
                        else if(mx2 < arr[i][cur])
                            mx2 = arr[i][cur], c2 = i;
                    }
                }
            }
            if(mx1 != 0 && mx2 != 0 && mx1 + mx2 > it)
            {
                cout << col << " " << it << " " << c1 << " " << mx1 << " " << c2 << " " << mx2;
                return 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: 8 / 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