結果
問題 | No.2372 既視感 |
ユーザー |
![]() |
提出日時 | 2023-07-07 23:07:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 12 ms / 2,000 ms |
コード長 | 2,505 bytes |
コンパイル時間 | 4,144 ms |
コンパイル使用メモリ | 258,644 KB |
最終ジャッジ日時 | 2025-02-15 08:22:21 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace atcoder;//using mint = modint1000000007;using mint = modint998244353;//g++ -I/opt/ac-library ./**.cppusing namespace std;using ll = long long;using ull = unsigned long long;//const long long MOD = 1000000007;const long long MOD = 998244353;const long double PI = 3.14159265358979;const long long INF = 1LL<<60;template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}#define deb(var) do{cout << #var << " : "; view(var);}while(0)template<typename T> void view(T e){cout << e << endl;}void view(vector<string>& v){cout << endl;for(auto& s :v){view(s);}cout << endl;}template<typename T> void view(vector<T>& v){for(auto& e :v){cout << e << " ";}cout << endl;}template<typename T> void view(vector<vector<T>>& vv){cout << endl;for(auto& v:vv){view(v);}}ll gcd(ll a, ll b){if (b == 0) return a;else return gcd(b, a % b);}ll lcm(ll x,ll y){return ll(x/gcd(x,y))*y;}template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define int long longbool contain(deque<string> &que, string t) {int n = que.size();for (int i=0; i<n; i++) {if (que[i] == t) return true;}return false;}int n;void push(deque<string> &que, string s) {que.push_back(s);if (que.size() > n) que.pop_front();}int32_t main() {int k, q; cin >> n >> k >> q;vector<string> a;while (q--) {int ty; cin >> ty;if(ty == 1) {string s; cin >> s;a.push_back(s);} else {int rem = 60;int res = 0;vector<string> t(6);vector<int> d(6);for (int i=0; i<6; i++) {cin >> t[i] >> d[i];}vector<string> b;for (int i=0; i<6; i++) {int m = a.size();int j = max(0LL, m - n);for (int l=j; l<m; l++) {if (t[i] == a[l]) d[i] = min(d[i], k);}if (d[i] > rem) break;res++;rem -= d[i];b.push_back(t[i]);}for (int i=0; i<b.size(); i++) {a.push_back(b[i]);}cout << res << "\n";}}}