結果
問題 | No.2372 既視感 |
ユーザー |
![]() |
提出日時 | 2023-07-29 16:46:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 2,395 bytes |
コンパイル時間 | 4,598 ms |
コンパイル使用メモリ | 264,952 KB |
最終ジャッジ日時 | 2025-02-15 20:59:26 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;#include <atcoder/all>using namespace atcoder;using ll = long long;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<ll>;using VVL = vector<VL>;using VD = vector<double>;using VVD = vector<VD>;using VS = vector<string>;using P = pair<ll,ll>;using VP = vector<P>;#define rep(i, n) for (ll i = 0; i < ll(n); i++)#define out(x) cout << x << endl#define dout(x) cout << fixed << setprecision(10) << x << endl#define all(a) (a).begin(),(a).end()#define rall(a) (a).rbegin(),(a).rend()#define sz(x) (int)(x.size())#define re0 return 0#define pcnt __builtin_popcountlltemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }constexpr int inf = 1e9;constexpr ll INF = 1e18;//using mint = modint1000000007;using mint = modint998244353;int di[4] = {1,0,-1,0};int dj[4] = {0,1,0,-1};int main(){const int m = 6;int n,k,q;cin >> n >> k >> q;queue<string> que;map<string,int> mp;rep(qi,q){int type;cin >> type;if(type == 1){string s;cin >> s;que.push(s);mp[s]++;if(sz(que) > n){mp[que.front()]--;if(mp[que.front()] == 0){mp.erase(que.front());}que.pop();}} else {VS t(m);VI d(m);rep(i,m) cin >> t[i] >> d[i];int now = 0;int res = 0;rep(i,m){if(mp.count(t[i])){if(now+min(d[i],k) <= 60){now += min(d[i],k);res++;} else break;} else {if(now+d[i] <= 60){now += d[i];res++;} else break;}}out(res);rep(i,res){que.push(t[i]);mp[t[i]]++;}while(sz(que) > n){mp[que.front()]--;if(mp[que.front()] == 0){mp.erase(que.front());}que.pop();}}}}