Submission #73765035

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i, start, end) for (auto i = (start); (i) < (end); (i)++)

// ======================================== //

int main()
{
    int N, M;
    cin >> N >> M;

    vector<bool> selected(N, false);
    rep(i, 0, N)
    {
        int L;
        cin >> L;
        vector<int> X(L);
        rep(j, 0, L) cin >> X[j], X[j]--;

        int ans = 0;
        rep(j, 0, L)
        {
            if (!selected[X[j]])
            {
                selected[X[j]] = true;
                ans = X[j] + 1;
                break;
            }
        }

        cout << ans << endl;
    }

    return 0;
}

Submission Info

Submission Time
Task B - Greedy Draft
User Yuulis
Language C++23 (GCC 15.2.0)
Score 200
Code Size 679 Byte
Status AC
Exec Time 2 ms
Memory 3596 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 20
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt
All 00-sample-01.txt, 00-sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 1 ms 3592 KiB
00-sample-02.txt AC 1 ms 3340 KiB
01-01.txt AC 1 ms 3576 KiB
01-02.txt AC 1 ms 3580 KiB
01-03.txt AC 1 ms 3584 KiB
01-04.txt AC 1 ms 3456 KiB
01-05.txt AC 1 ms 3584 KiB
01-06.txt AC 2 ms 3576 KiB
01-07.txt AC 1 ms 3580 KiB
01-08.txt AC 2 ms 3568 KiB
01-09.txt AC 1 ms 3596 KiB
01-10.txt AC 1 ms 3584 KiB
01-11.txt AC 1 ms 3584 KiB
01-12.txt AC 2 ms 3532 KiB
01-13.txt AC 2 ms 3592 KiB
01-14.txt AC 2 ms 3576 KiB
01-15.txt AC 2 ms 3584 KiB
01-16.txt AC 1 ms 3392 KiB
01-17.txt AC 1 ms 3392 KiB
01-18.txt AC 1 ms 3532 KiB