Galactic Collegiate Programming Contest

题意：有n个人，有m个过题记录，每个记录告诉你某个人在一定时间内过了一题，每次记录后输出1号的排名

解题思路：离散化+树状数组

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int n, m, a[100009], b[100009];
int sum[100009], t[100009], cnt[300009];

struct node
{
int id, sum, t;
bool operator<(const node &a)const
{
if (a.sum != sum) return sum > a.sum;
else if (a.t != t) return t < a.t;
return id < a.id;
}
}x[300009], pre;

int lowbit(int k) { return k&-k; }
void update(int k, int val)
{
for (int i = k; i <= m + n; i += lowbit(i)) cnt[i]+=val;
}
int query(int k)
{
int ans = 0;
for (int i = k; i; i -= lowbit(i)) ans += cnt[i];
return ans;
}

int get(node pre)
{
int l = 1, r = n + m + 1, ans;
while (l <= r)
{
int mid = (l + r) >> 1;
if (x[mid].sum < pre.sum) r = mid - 1;
else if (x[mid].sum > pre.sum) l = mid + 1;
else if (x[mid].t > pre.t) r = mid - 1;
else if (x[mid].t < pre.t) l = mid + 1;
else if (x[mid].id > pre.id) r = mid - 1;
else if (x[mid].id < pre.id) l = mid + 1;
else { ans = mid; break; }
}
return ans;
}

int main()
{
while (~scanf("%d%d", &n, &m))
{
for (int i = 1; i <= n; i++)
{
sum[i] = t[i] = 0;
x[i] = { i,0,0 };
}
for (int i = 1; i <= m; i++)
{
scanf("%d%d", &a[i], &b[i]);
sum[a[i]]++, t[a[i]] += b[i];
x[n+i].id = a[i], x[n+i].sum = sum[a[i]], x[n+i].t = t[a[i]];
}
sort(x + 1, x + 1 + m + n);
memset(sum, 0, sizeof sum);
memset(cnt, 0, sizeof cnt);
memset(t, 0, sizeof t);
for (int i = 1; i <= n; i++)
{
pre = { i,0,0 };
int k = get(pre);
update(k, 1);
}
for (int i = 1; i <= m; i++)
{
pre.id = a[i], pre.sum = sum[a[i]], pre.t = t[a[i]];
int k = get(pre);
update(k, -1);
sum[a[i]]++, t[a[i]] += b[i];
pre.id = a[i], pre.sum = sum[a[i]], pre.t = t[a[i]];
k = get(pre);
update(k, 1);
pre = { 1,sum[1],t[1] };
k = get(pre);
printf("%d\n", query(k));
}
}
return 0;
}