結果
問題 | No.449 ゆきこーだーの雨と雪 (4) |
ユーザー |
|
提出日時 | 2022-07-18 16:58:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 260 ms / 5,000 ms |
コード長 | 4,085 bytes |
コンパイル時間 | 2,862 ms |
コンパイル使用メモリ | 210,312 KB |
最終ジャッジ日時 | 2025-01-30 10:53:47 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
ソースコード
#include<bits/stdc++.h>using namespace std;#pragma GCC optimize("Ofast")#define rep(i,n) for(ll i=0;i<n;i++)#define repl(i,l,r) for(ll i=(l);i<(r);i++)#define per(i,n) for(ll i=(n)-1;i>=0;i--)#define perl(i,r,l) for(ll i=r-1;i>=l;i--)#define fi first#define se second#define pb push_back#define ins insert#define pqueue(x) priority_queue<x,vector<x>,greater<x>>#define all(x) (x).begin(),(x).end()#define CST(x) cout<<fixed<<setprecision(x)#define rev(x) reverse(x);using ll=long long;using vl=vector<ll>;using vvl=vector<vector<ll>>;using pl=pair<ll,ll>;using vpl=vector<pl>;using vvpl=vector<vpl>;const ll MOD=1000000007;const ll MOD9=998244353;const int inf=1e9+10;const ll INF=4e18;const ll dy[8]={1,0,-1,0,1,1,-1,-1};const ll dx[8]={0,1,0,-1,1,-1,1,-1};template <typename T> inline bool chmax(T &a, T b) {return ((a < b) ? (a = b, true) : (false));}template <typename T> inline bool chmin(T &a, T b) {return ((a > b) ? (a = b, true) : (false));}template<typename U = unsigned, int B = 32>class binary_trie {struct node {int cnt;node *ch[2];node() : cnt(0), ch{ nullptr, nullptr } {}};node* add(node* t, U val, int b = B - 1) {if (!t) t = new node;t->cnt += 1;if (b < 0) return t;bool f = (val >> (U)b) & (U)1;t->ch[f] = add(t->ch[f], val, b - 1);return t;}node* sub(node* t, U val, int b = B - 1) {assert(t);t->cnt -= 1;if (t->cnt == 0) return nullptr;if (b < 0) return t;bool f = (val >> (U)b) & (U)1;t->ch[f] = sub(t->ch[f], val, b - 1);return t;}U get_min(node* t, U val, int b = B - 1) const {assert(t);if (b < 0) return 0;bool f = (val >> (U)b) & (U)1; f ^= !t->ch[f];return get_min(t->ch[f], val, b - 1) | ((U)f << (U)b);}U get(node* t, int k, int b = B - 1) const {if (b < 0) return 0;int m = t->ch[0] ? t->ch[0]->cnt : 0;return k < m ? get(t->ch[0], k, b - 1) : get(t->ch[1], k - m, b - 1) | ((U)1 << (U)b);}int count_lower(node* t, U val, int b = B - 1) {if (!t || b < 0) return 0;bool f = (val >> (U)b) & (U)1;return (f && t->ch[0] ? t->ch[0]->cnt : 0) + count_lower(t->ch[f], val, b - 1);}node *root;public:binary_trie() : root(nullptr) {}int size() const {return root ? root->cnt : 0;}bool empty() const {return !root;}void insert(U val) {root = add(root, val);}void erase(U val) {root = sub(root, val);}U max_element(U bias = 0) const {return get_min(root, ~bias);}U min_element(U bias = 0) const {return get_min(root, bias);}int lower_bound(U val) { // return idreturn count_lower(root, val);}int upper_bound(U val) { // return idreturn count_lower(root, val + 1);}U operator[](int k) const {assert(0 <= k && k < size());return get(root, k);}int count(U val) const {if (!root) return 0;node *t = root;for (int i = B - 1; i >= 0; i--) {t = t->ch[(val >> (U)i) & (U)1];if (!t) return 0;}return t->cnt;}};int main(){ios::sync_with_stdio(false);std::cin.tie(nullptr);ll n;cin >> n;vl level(n);rep(i,n)cin >> level[i];vl solver(n);map<string,ll> points;vl num(100000);binary_trie<ll,64> order;ll t;cin >> t;ll base=1e6;ll subbase=2e5;while(t--){string s;cin >> s;char x;cin >> x;if(x=='?'){ll pts=points[s];ll f=order.lower_bound(pts);cout << order.size()-f << endl;}else{ll p=x-'A';ll er=(points.count(s)? points[s]/base:0);if(points.count(s)){order.erase(points[s]);}solver[p]++;er+=level[p]*50+level[p]*50*10/(8+2*solver[p]);ll cvt=er*base+subbase-num[er];num[er]++;points[s]=cvt;order.insert(cvt);}}}