-
个人简介
没写完的代码:
#include <bits/stdc++.h> using namespace std; // #define int long long const int N = 2e5 + 5; string op[N]; int n, X[N], Y[N]; int lshx[N], totx, lshy[N], toty; int get(int lsh[], int tot, int x) { return lower_bound(lsh + 1, lsh + tot + 1, x) - lsh; } multiset<int> t[N << 2]; #define lc (p << 1) #define rc (lc | 1) void insert(int x, int y, int cl = 1, int cr = n, int p = 1) { t[p].insert(y); if (cl == cr) return; int mid = (cl + cr) >> 1; x <= mid ? insert(x, y, cl, mid, lc) : insert(x, y, mid + 1, cr, rc); } using pii = pair<int, int>; signed main() { ios::sync_with_stdio(false); #ifdef LUOTIANYI clock_t t0 = clock(); freopen("data.in", "r", stdin); freopen("data.out", "w", stdout); #endif // Don't stop. Don't hide. Follow the light, and you'll find tomorrow. #ifdef LUOTIANYI cerr << "Time used:" << clock() - t0 << "ms" << endl; #endif return 0; }
-
通过的题目
-
最近活动
This person is lazy and didn't join any contests or homework. -
最近编写的题解
This person is lazy and didn't write any solutions. -
Stat
-
Rating
题目标签
- 2006
- 1
- 系统测试
- 1
- BJOI
- 1
- 模拟
- 1
- 图论
- 1
- O2优化
- 1
- 负权环
- 1