結果
問題 | No.714 回転寿司屋のシミュレート |
ユーザー |
![]() |
提出日時 | 2019-08-31 23:39:56 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 2,715 bytes |
コンパイル時間 | 1,574 ms |
コンパイル使用メモリ | 175,292 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-25 22:37:33 |
合計ジャッジ時間 | 2,595 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 35 |
ソースコード
#include "bits/stdc++.h"using namespace std;typedef long long ll;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const int INF = 1e9;const ll LINF = 1e18;inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out<< Mat[i];} return out; }template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}/*<url:>問題文=============================================================================================================================解説=============================================================================================================================*/template<class Type>Type solve(Type res = Type()){int N; cin >> N;vector<vector<string>> G(21);while(N--){int com; cin >> com;if(com == 0){int n,m; cin >> n >> m;G[n].resize(m);for(auto& in:G[n]) cin >> in;}else if(com == 1){string B; cin >> B;int id = -1;for(int i = 1; i <= 20;i++){if(count(G[i].begin(),G[i].end(),B)){G[i].erase(find(G[i].begin(),G[i].end(),B));id = i;break;}}cout << id << endl;}else{int C; cin >> C;G[C].clear();}}return res;}int main(void) {cin.tie(0); ios_base::sync_with_stdio(false);solve(0);// cout << fixed << setprecision(15) << solve<ll>() << endl;return 0;}