Codeforces Round #348 E. Little Artem and Time Machine 树状数组 单点更新
来源:互联网 发布:centos显卡驱动卸载 编辑:程序博客网 时间:2024/09/21 06:34
传送门
题意
有三个操作
1 x y,在第x秒插入一个y
2 x y,在第x秒移走一个y
3 x y, 问第x秒有多少个y
大概算一算,树状数组就可以解决,单点更新。
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-./// __.' ~. .~ `.__/// .'// \./ \\`./// .'// | \\`./// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`./// .'//.-" `-. | .-' "-.\\`./// .'//______.============-.. \ | / ..-============.______\\`./// .'______________________________\|/______________________________`.#pragma comment(linker, "/STACK:1024000000,1024000000")#include <vector>#include <iostream>#include <string>#include <map>#include <stack>#include <cstring>#include <queue>#include <list>#include <stdio.h>#include <set>#include <algorithm>#include <cstdlib>#include <cmath>#include <iomanip>#include <cctype>#include <sstream>#include <functional>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;#define pi acos(-1)#define s_1(x) scanf("%d",&x)#define s_2(x,y) scanf("%d%d",&x,&y)#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)#define S_1(x) scan_d(x)#define S_2(x,y) scan_d(x),scan_d(y)#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)#define PI acos(-1)#define endl '\n'#define srand() srand(time(0));#define me(x,y) memset(x,y,sizeof(x));#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)#define close() ios::sync_with_stdio(0); cin.tie(0);#define FOR(x,n,i) for(int i=x;i<=n;i++)#define FOr(x,n,i) for(int i=x;i<n;i++)#define fOR(n,x,i) for(int i=n;i>=x;i--)#define fOr(n,x,i) for(int i=n;i>x;i--)#define W while#define sgn(x) ((x) < 0 ? -1 : (x) > 0)#define bug printf("***********\n");#define db double#define ll long long#define mp make_pair#define pb push_backtypedef long long LL;typedef pair <int, int> ii;const int INF=0x3f3f3f3f;const LL LINF=0x3f3f3f3f3f3f3f3fLL;const int dx[]={-1,0,1,0,1,-1,-1,1};const int dy[]={0,1,0,-1,-1,1,-1,1};const int maxn=1e6+10;const int maxx=4e5+10;const double EPS=1e-8;const double eps=1e-8;const int mod=1e9+7;template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}template <class T>inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}if(IsN) num=-num;return true;}void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}void print(LL a){ Out(a),puts("");}//freopen( "in.txt" , "r" , stdin );//freopen( "data.txt" , "w" , stdout );//cerr << "run time is " << clock() << endl;int N=1e9+7;map<int,int>c[maxn];map<int,int>vis;int lowbit(int x){ return x&-x;}void update(int x,int y,int num){ for(int i=y;i<N;i+=lowbit(i)) c[x][i]+=num;}ll getsum(int x,int y){ ll ans = 0; for(int i=y;i;i-=lowbit(i)) { ans+=c[x][i]; } return ans;}int n;int tot=0;void solve(){ W(s_1(n)!=EOF) { W(n--) { int op,x,y; s_3(op,x,y); if(op==1&&!vis[y])vis[y]=++tot; if(op==1)update(vis[y],x,1); if(op==2)update(vis[y],x,-1); if(op==3)printf("%d\n",getsum(vis[y],x)); } }}int main(){ //freopen( "in.txt" , "r" , stdin ); //freopen( "data.txt" , "w" , stdout ); int t=1; //init(); //s_1(t); for(int cas=1;cas<=t;cas++) { //printf("Case #%d: ",cas); solve(); }}
阅读全文
0 0
- Codeforces Round #348 E. Little Artem and Time Machine 树状数组 单点更新
- Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition) E. Little Artem and Time Machine 树状数组
- CodeForces 669E Little Artem and Time Machine(主席树+树状数组)
- CodeForces 669E Little Artem and Time Machine(树状数组)
- Codeforces 669E Little Artem and Time Machine (离散化树状数组)
- Codeforces Round #348-Little Artem and Time Machine
- cf#348-E. Little Artem and Time Machine-树状数组+map节点(动态开点树状数组)
- [CDQ分治] codeforces 669E. Little Artem and Time Machine
- Codeforces Round 669D Little Artem and Time Machine
- Codeforces #669 Div2 E. Little Artem and Time Machine(离线、优先队列)
- CodeForces 641 E.Little Artem and Time Machine(BIT+map)
- Codeforces Round #348 E. Little Artem and Time Machine(给你一个n,有三种选择,1表示增加一个值,2表示删除这个数的一个值,3表示查询)
- Codeforces Round #348 (div 2) A. Little Artem and Presents
- Codeforces Round #348 (div 2) C. Little Artem and Matrix
- [2-SAT] Codeforces 668E #348 (VK Cup 2016 Round 2, Div. 1 Edition) E. Little Artem and 2-SAT
- Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition) D. Little Artem and Dance
- CF Round #348 Div. 2 A. Little Artem and Present B. Little Artem and Grasshopper C. Little Artem and
- Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)-A. Little Artem and Presents(模拟)
- 取出list里面某个字段的值
- 地区导航列表
- 湘潭大学-基于Dragonboard 410c教室资源管理与信息查询系统(一)
- Mycat学习实战-Mycat初识
- 51nod 1099 任务执行顺序(贪心)
- Codeforces Round #348 E. Little Artem and Time Machine 树状数组 单点更新
- Java 8系列之重新认识HashMap
- Android中PullToRefreshListView(上拉,下拉)的介绍以及操作。
- [BZOJ4292][PA2015]Równanie 枚举
- echo print_r var_dump 区别
- DXP,AD不用新建PCB完美解决 Unknown Pin 和Failed to add class member 问题
- BZOJ3943: [Usaco2015 Feb]SuperBull
- 讯飞--语音识别OC
- li