提出 #73476445

---

ソースコード 拡げる

#include <algorithm>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; cin >> n >> m;
    vector<bool> v(m+1,true);
    rep(i,n){
        int l; cin >> l;
        int dr = 0;
        
            bool ok = false;
        rep(j,l){
            int a; cin >> a;
            if(ok) continue;
            if(v[a]){
                v[a] = false;
                dr = a;
                ok = true;
            }
        }
        cout << dr << endl;
    }
}

提出情報

ジャッジ結果