Untitled
Anonymous
c_cpp
02/21/2026 7:18 PM
708 B
28
Indexable
#include <bits/stdc++.h>
using namespace std;
// Time Complexity: O(nm log m)
// Memory Complexity: O(m)
using ll = long long;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int tc = 1;
while(tc--) {
int n, m; cin >> n >> m;
set<int> s;
for(int i = 1; i <= m; i++) {
s.insert(i);
}
for(int i = 0; i < n; i++) {
int l; cin >> l;
int ans = 0;
while(l--) {
int x; cin >> x;
if(!ans && s.count(x)) {
s.erase(x);
ans = x;
}
}
cout << ans << "\n";
}
}
return 0;
}Editor is loading...
Leave a Comment