Submission #73487701


Source Code Expand

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


void sol();

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    sol();
    return 0;
}

void sol() {
    int n, m;
    cin >> n >> m;

    unordered_map<int,bool> Hash;
    for (int i = 1; i <= m; ++i) {
        Hash[i] = true;
    }

    vector<int> ans(n,0);
    for (int i = 0; i < n; ++i) {
        int l;
        cin >> l;
        for (int j = 0; j < l; ++j) {
            int p;
            cin >> p;
            if(!ans[i]) {
                if(Hash[p]) {
                    ans[i] = p;
                    Hash[p] = false;
                }
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        cout << ans[i] << '\n';
    }
}

Submission Info

Submission Time
Task B - Greedy Draft
User cslgZ09224220
Language C++23 (GCC 15.2.0)
Score 200
Code Size 790 Byte
Status AC
Exec Time 1 ms
Memory 3656 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 3620 KiB
00-sample-02.txt AC 1 ms 3656 KiB
01-01.txt AC 1 ms 3572 KiB
01-02.txt AC 1 ms 3620 KiB
01-03.txt AC 1 ms 3592 KiB
01-04.txt AC 1 ms 3620 KiB
01-05.txt AC 1 ms 3488 KiB
01-06.txt AC 1 ms 3488 KiB
01-07.txt AC 1 ms 3464 KiB
01-08.txt AC 1 ms 3620 KiB
01-09.txt AC 1 ms 3456 KiB
01-10.txt AC 1 ms 3620 KiB
01-11.txt AC 1 ms 3616 KiB
01-12.txt AC 1 ms 3548 KiB
01-13.txt AC 1 ms 3548 KiB
01-14.txt AC 1 ms 3548 KiB
01-15.txt AC 1 ms 3568 KiB
01-16.txt AC 1 ms 3648 KiB
01-17.txt AC 1 ms 3620 KiB
01-18.txt AC 1 ms 3488 KiB