提出 #73483356
ソースコード 拡げる
#if !__INCLUDE_LEVEL__
#include __FILE__
int main(){
int n,m;
cin >> n >> m;
vector<bool> zaiko(m+1,1);
int l;
rep(_,0,n){
cin >> l;
int x;
int ans=0;
REP(__,1,l){
cin >> x;
if(zaiko[x]){
if(ans==0){
zaiko[x]=0;
ans=x;
}
}
}
cout << ans << el;
}
}
#else
#include <bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
#define rep(i, x, limit) for (ll i = (ll)x; i < (ll)limit; i++)
#define REP(i, x, limit) for (ll i = (ll)x; i <= (ll)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template<typename T1, typename T2>
std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){
os << "{" << p.first << "," << p.second << "}";
return os;
}
// 配列の要素を空白区切りで出力 第二引数をtrueにすると改行区切り
template<typename T> inline void print_vec(const vector<T> &v, bool split_line=false) {
if(v.empty()){
cout << "This vector is empty." << el;
return;
}
constexpr bool isValue = is_integral<T>::value;
for (int i = 0; i < (int)v.size(); i++) {
if constexpr(isValue){
if((v[i]==inf) || (v[i]==infl)) cout << 'x' << " \n"[split_line];
else cout << v[i] << " \n"[split_line || i+1==(int)v.size()];
}else cout << v[i] << " \n"[split_line || i+1==(int)v.size()];
}
}
template<typename T1, typename T2> inline void print_vec(const vector<pair<T1,T2>> &v, bool split_line=false){
if(v.empty()){
cout << "This vector is empty." << el;
return;
}
for(int i = 0; i < (int)v.size(); i++){
cout << '{';
auto [a,b] = v[i];
constexpr pair<bool,bool> isValue = {is_integral<T1>::value, is_integral<T2>::value};
if constexpr(isValue.first){
if(a==inf || a==infl) cout << "x,";
else cout << a << ",";
}else cout << a << ",";
if constexpr(isValue.second){
if(b==inf || b==infl) cout << "x,";
else cout << b;
}else cout << b;
cout << "}" << " \n"[split_line || i+1==(int)v.size()];
}
}
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
bool compare = a < b;
if(compare) a = b;
return compare;
}
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
bool compare = a > b;
if(compare) a = b;
return compare;
}
// std::chronoを利用した時間計測用クラス
class Timer{
chrono::system_clock::time_point start;
public:
Timer() : start(chrono::system_clock::now()) {}
double count(){
chrono::duration<double> Time_ = chrono::system_clock::now() - start;
return Time_.count();
}
bool is_under(double x){
return (this -> count()) < x;
}
};
#endif
提出情報
| 提出日時 |
|
| 問題 |
B - Greedy Draft |
| ユーザ |
xX0Mame0Xx |
| 言語 |
C++23 (GCC 15.2.0) |
| 得点 |
200 |
| コード長 |
3641 Byte |
| 結果 |
AC |
| 実行時間 |
1 ms |
| メモリ |
3668 KiB |
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
200 / 200 |
| 結果 |
|
|
| セット名 |
テストケース |
| 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 |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 00-sample-01.txt |
AC |
1 ms |
3616 KiB |
| 00-sample-02.txt |
AC |
1 ms |
3452 KiB |
| 01-01.txt |
AC |
1 ms |
3576 KiB |
| 01-02.txt |
AC |
1 ms |
3448 KiB |
| 01-03.txt |
AC |
1 ms |
3448 KiB |
| 01-04.txt |
AC |
1 ms |
3668 KiB |
| 01-05.txt |
AC |
1 ms |
3532 KiB |
| 01-06.txt |
AC |
1 ms |
3604 KiB |
| 01-07.txt |
AC |
1 ms |
3616 KiB |
| 01-08.txt |
AC |
1 ms |
3448 KiB |
| 01-09.txt |
AC |
1 ms |
3576 KiB |
| 01-10.txt |
AC |
1 ms |
3584 KiB |
| 01-11.txt |
AC |
1 ms |
3452 KiB |
| 01-12.txt |
AC |
1 ms |
3648 KiB |
| 01-13.txt |
AC |
1 ms |
3592 KiB |
| 01-14.txt |
AC |
1 ms |
3648 KiB |
| 01-15.txt |
AC |
1 ms |
3648 KiB |
| 01-16.txt |
AC |
1 ms |
3532 KiB |
| 01-17.txt |
AC |
1 ms |
3452 KiB |
| 01-18.txt |
AC |
1 ms |
3592 KiB |