結果

問題 No.714 回転寿司屋のシミュレート
ユーザー naimonon77
提出日時 2018-11-18 09:26:06
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 12 ms / 2,000 ms
コード長 3,779 bytes
コンパイル時間 2,516 ms
コンパイル使用メモリ 205,332 KB
最終ジャッジ日時 2025-01-06 16:50:49
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a;             \
                                   c > 0 ? i < b : i > b; \
                                   i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long
#ifdef LOCAL_ENV
#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " = " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif
int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
const int INF = (int)1 << 60;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }
//.....................
const int MAX = (int)2e5 + 5;
vector<string> split(const string &str, char sep)
{
    vector<string> v;
    stringstream ss(str);
    string buffer;
    while (getline(ss, buffer, sep))
    {
        v.push_back(buffer);
    }
    return v;
}
string join(const vector<string>& v, const char* delim = 0) {
    string s;
    if (!v.empty()) {
        s += v[0];
        for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
            if (delim) s += delim;
            s += v[i];
        }
    }
    return s;
}
template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
    return accumulate(begin, end, 0ll);
}
template<typename T>
T gcd(T a, T b)
{
    T c;
    while (a != 0) {
        c = a; a = b%a;  b = c;
    }
    return b;
}
template<typename T>
T bit_count(T N) {
    T cnt = 0;
    while (N) {
        if (N & 1) cnt++;
        N >>= 1;
    }
    return cnt;
}
template<typename T>
void print_vec(ostream& ostream, vector<T> a) {
    rep(i, a.size() - 1) ostream << a[i] << " ";
    ostream << a.back() << endl;
}
ll pow_n(ll x,ll n) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x;
        x = x * x;
        n >>= 1;
    }
    return res;
}
class Solver {
public:
    int H, W;
    bool grid_ng(int y, int x) {
        return y < 0 || y >= H || x < 0 || x >= W;
    }
    struct Point {
        int y, x;
        bool operator < (const Point& r) const {
            if (y != r.y) return y < r.y;
            return x < r.x;
        }
    };
    struct Mentaiko {
        int id, cnt;
        bool operator > (const Mentaiko& r) const {
            if (cnt != r.cnt) return cnt > r.cnt;
            return id < r.id;
        }
    };
    vector<string> wants[25];
    void type0() {
        int n, m; cin >> n >> m;
        vector<string> want(m);
        rep(i, m) cin >> want[i];
        wants[n] = want;
    }   
    
    void type1() {
        string B; cin >> B;
        rep(i, 21) {
            auto itr = find(all(wants[i]), B);
            if (itr == wants[i].end()) continue;
            else {
                wants[i].erase(itr);
                cout << i << endl;
                return;
            }
        }
        cout << -1 << endl;
    }   
    
    void type2() {
        int C; cin >> C;
        wants[C].clear();
    }
    void solve() {
        int N; cin >> N;
        rep(i, N) {
            int type; cin >> type;
            if (type == 0) type0();
            if (type == 1) type1();
            if (type == 2) type2();
        }
    }
};
signed main()
{
    srand((unsigned int)time(NULL));
    cout << fixed << setprecision(20);
    auto ptr = new Solver();
    ptr->solve();
    delete ptr;
    //while (true) {
    //  if (cin.eof() == true) break;
    //  auto ptr = new Solver();
    //  ptr->solve();
    //  delete ptr;
    //}
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0