Submission #73490876


Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <cctype>
#include <chrono>
#include <numeric>
#include <cmath>
#include <climits>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int> >;
using vs = vector<string>;
using vvc = vector<vector<char> >;
using pii = pair<int, int>;
using vpii = vector<pii>;
#define el '\n'
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define lrep(i, n) for(ll i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define lrep2(i, s, n) for(ll i = (long long)(s); i < (long long)(n); i++)
#define rrep(i, n) for(int i =(int)(n)-1; i >= 0; i--)
#define lrrep(i, n) for(ll i =(long long)(n)-1; i >= 0; i--)
#define rrep2(i, b, n) for(int i =(int)(n); i > (int)(b); i--)
#define erep(i, n) for(int i = 0; i <= (int)(n); i++)
#define lerep(i, n) for(ll i = 0; i <= (long long)(n); i++)
#define erep2(i, s, n) for(int i = (int)(s); i <= (int)(n); i++)
#define lerep2(i, s, n) for(ll i = (ll)(s); i <= (ll)(n); i++)
#define vin(array, size) rep(i, (int)(size))cin >> array[i]
#define vvin(array, size1, size2) rep(i, (int)(size1)) rep(j, (int)(size2)) cin >> array[i][j]
#define vout(array, size) rep(i, (int)(size))cout << array[i] << el
#define vvout(array, size1, size2) rep(i, (int)(size1)) rep(j, (int)(size2)) cout << array[i][j] << " \n"[j == size2-1]
#define pb emplace_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define spa << " " <<
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); } }init; // printf()を使うときは消す.
const int inf = INT_MAX;
const ll INF = LLONG_MAX;

int main() {
  int n, m;
  cin >> n >> m;
  vector<bool> drink(m, true);
  
  rep(i, n) {
    int l;
    cin >> l;
    bool flag = false;
    
    rep(j, l) {
      int x;
      cin >> x;
      if(!flag && drink[x-1]) {
        cout << x << el;
        drink[x-1] = false;
        flag = true;
      }
    }
    
    if(!flag) cout << 0 << el;
    
  }

  return 0;
}

Submission Info

Submission Time
Task B - Greedy Draft
User yurin442
Language C++23 (GCC 15.2.0)
Score 200
Code Size 2218 Byte
Status AC
Exec Time 1 ms
Memory 3604 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 3588 KiB
00-sample-02.txt AC 1 ms 3572 KiB
01-01.txt AC 1 ms 3560 KiB
01-02.txt AC 1 ms 3588 KiB
01-03.txt AC 1 ms 3572 KiB
01-04.txt AC 1 ms 3452 KiB
01-05.txt AC 1 ms 3588 KiB
01-06.txt AC 1 ms 3528 KiB
01-07.txt AC 1 ms 3532 KiB
01-08.txt AC 1 ms 3484 KiB
01-09.txt AC 1 ms 3472 KiB
01-10.txt AC 1 ms 3528 KiB
01-11.txt AC 1 ms 3544 KiB
01-12.txt AC 1 ms 3604 KiB
01-13.txt AC 1 ms 3540 KiB
01-14.txt AC 1 ms 3472 KiB
01-15.txt AC 1 ms 3496 KiB
01-16.txt AC 1 ms 3536 KiB
01-17.txt AC 1 ms 3580 KiB
01-18.txt AC 1 ms 3540 KiB