結果
問題 | No.2421 entersys? |
ユーザー |
|
提出日時 | 2023-08-12 15:19:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,864 ms / 3,000 ms |
コード長 | 6,476 bytes |
コンパイル時間 | 5,495 ms |
コンパイル使用メモリ | 283,700 KB |
最終ジャッジ日時 | 2025-02-16 06:06:49 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 28 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;using lint = long long;using ulint = unsigned long long;using llint = __int128;#define endl '\n'lint const mod107 = 1e9+7;using mint107 = modint1000000007;long const mod = 998244353;using mint = modint998244353;int const INF = 1<<30;lint const INF64 = 1LL<<61;lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower= mid;}}return upper;}lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c +ans;}}return ans;}string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j]<= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}lint Kai[20000001]; bool firstCallnCr = true;lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= p;} firstCallnCr =false;} if(n<0)return 0;if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}#define rep(i, n) for(int i = 0; i < n; i++)#define repp(i, x, y) for(int i = x; i < y; i++)#define vec vector#define pb push_back#define se second#define fi first#define all(x) x.begin(),x.end()unsigned long long Rand(){static unsigned long long x=88172645463325252LL;x^=(x<<13);x^=(x>>7);return (x^=(x<<17));}struct Frac {lint upper, lower;Frac() {Frac(0,1);}Frac(lint u, lint l) {assert(l != 0);if(u <= 0 && l < 0) {upper = -u;lower = -l;} else {upper = u;lower = l;}reduction();}Frac(lint u) {upper = u;lower = 1;}void reduction() {if(upper != 0) {lint g = gcd(abs(upper), abs(lower));upper /= g;lower /= g;if(lower < 0) {lower *= -1;upper *= -1;}} else {lower = 1;}}Frac operator+(const Frac &other) {lint L = lower * other.lower;lint U = upper*other.lower + lower*other.upper;return Frac(U, L);}Frac operator-(const Frac &other) {lint L = lower * other.lower;lint U = upper*other.lower - lower*other.upper;upper = U;lower = L;return Frac(U, L);}bool operator<=(const Frac &other) {return upper*other.lower <= lower*other.upper;}Frac operator*(const Frac &other) {lint L = lower * other.lower;lint U = upper * other.upper;return Frac(U, L);}Frac operator/(const Frac &other) {assert(other.upper != 0);lint L = lower * other.upper;lint U = upper * other.lower;return Frac(U, L);}};bool operator<(const Frac &left, const Frac &right) {return left.upper*right.lower < left.lower*right.upper;}struct edge{int to;};using graph = vector<vector<edge>>;int main(){// vec<tuple<int, int, string, int>>query; // 時刻, query, name, ansint n;cin >> n;map<int, set<pair<int, int>>>mp;map<int, int>m1, m2;string x[n];int l[n], r[n];map<string, int>toId;int idcount = 1;rep(i, n) {cin >> x[i] >> l[i] >> r[i];m1[l[i]]++;m1[r[i]]++;if(toId[x[i]] == 0) {toId[x[i]] = idcount;idcount++;}}int q;cin >> q;vec<vec<int>>query;rep(i, q) {int t;cin >> t;if(t == 1) {string xx; int tt;cin >> xx >> tt;m1[tt]++;query.pb({t, toId[xx], tt});} else if(t == 2) {int tt;cin >> tt;m1[tt]++;query.pb({t, tt});} else {string xx; int ll; int rr;cin >> xx >> ll >> rr;if(toId[xx] == 0) {toId[xx] = idcount;idcount++;}m1[rr]++;m1[ll]++;query.pb({t, toId[xx], ll, rr});}}int cc = 1;for(auto p: m1) {m2[p.first] = cc;cc++;}fenwick_tree<int>fw(cc + 20);rep(i, n) {fw.add(m2[l[i]], 1);fw.add(m2[r[i]] +1 , -1);mp[toId[x[i]]].insert({l[i],1});mp[toId[x[i]]].insert({r[i] + 1, -1});}rep(i, q) {if(query[i][0] == 1) {if(query[i][1] == 0) {cout << "No" << endl;} else {int t = query[i][2];auto it = mp[query[i][1]].lower_bound({t, INF});if(it == mp[query[i][1]].begin()) {cout << "No" << endl;continue;}it--;if((*it).second == 1) {cout << "Yes" << endl;} else {cout << "No" << endl;}}} else if(query[i][0] == 2) {int t = query[i][1];cout << fw.sum(0, m2[t]+1) << endl;} else {int id = query[i][1];int ll = query[i][2];int rr = query[i][3];fw.add(m2[ll], 1);fw.add(m2[rr] +1 , -1);mp[id].insert({ll,1});mp[id].insert({rr + 1, -1});}}}