Submission #73472592
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
typedef long long ll;
typedef pair<ll,ll> PII;
typedef array<ll,2> a2;
typedef array<ll,3> a3;
int n,m,k;
int a[N],tf[N];
void 打卡啦摩托(){
cin>>n>>m;
for(int i=1;i<=n;i++){
int ans=0;
int x;
cin>>x;
for(int j=1;j<=x;j++) cin>>a[j];
for(int j=1;j<=x;j++){
if(!tf[a[j]]){
ans=a[j];
tf[a[j]]=1;
break;
}
}
cout<<ans<<"\n";
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int _=1;
// cin>>_;
while(_--){
打卡啦摩托();
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Greedy Draft |
| User | zhishengie |
| Language | C++23 (GCC 15.2.0) |
| Score | 200 |
| Code Size | 713 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 3716 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| 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 | 3556 KiB |
| 00-sample-02.txt | AC | 1 ms | 3588 KiB |
| 01-01.txt | AC | 1 ms | 3472 KiB |
| 01-02.txt | AC | 1 ms | 3600 KiB |
| 01-03.txt | AC | 1 ms | 3716 KiB |
| 01-04.txt | AC | 1 ms | 3516 KiB |
| 01-05.txt | AC | 1 ms | 3552 KiB |
| 01-06.txt | AC | 1 ms | 3472 KiB |
| 01-07.txt | AC | 1 ms | 3568 KiB |
| 01-08.txt | AC | 1 ms | 3500 KiB |
| 01-09.txt | AC | 1 ms | 3588 KiB |
| 01-10.txt | AC | 1 ms | 3504 KiB |
| 01-11.txt | AC | 1 ms | 3712 KiB |
| 01-12.txt | AC | 1 ms | 3584 KiB |
| 01-13.txt | AC | 1 ms | 3684 KiB |
| 01-14.txt | AC | 1 ms | 3448 KiB |
| 01-15.txt | AC | 1 ms | 3500 KiB |
| 01-16.txt | AC | 1 ms | 3472 KiB |
| 01-17.txt | AC | 1 ms | 3424 KiB |
| 01-18.txt | AC | 1 ms | 3516 KiB |