結果
| 問題 |
No.1982 [Cherry 4th Tune B] 絶険
|
| コンテスト | |
| ユーザー |
 xyz2606
|
| 提出日時 | 2022-06-17 22:00:43 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 417 ms / 3,000 ms |
| コード長 | 5,913 bytes |
| コンパイル時間 | 2,575 ms |
| コンパイル使用メモリ | 153,204 KB |
| 実行使用メモリ | 33,152 KB |
| 最終ジャッジ日時 | 2024-10-09 07:54:41 |
| 合計ジャッジ時間 | 12,815 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 35 |
ソースコード
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<chrono>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
#include<type_traits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(chrono::system_clock::now().time_since_epoch().count());
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
const int maxn = 131072;
static char buf[maxn],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
int res(0);
char c = getchar();
while(c < '0') c = getchar();
while(c >= '0') {
res = res * 10 + (c - '0');
c = getchar();
}
return res;
}
inline LL fastpo(LL x, LL n, LL mod) {
LL res(1);
while(n) {
if(n & 1) {
res = res * (LL)x % mod;
}
x = x * (LL) x % mod;
n /= 2;
}
return res;
}
template<LL mod> struct Num {
LL a;
Num operator + (const Num & b) { return Num{(a + b.a) % mod}; }
Num operator - (const Num & b) { return Num{(a - b.a + mod) % mod}; }
Num operator * (const Num & b) { return Num{a * b.a % mod}; }
Num operator / (const Num & b) { return Num{a * fastpo(b.a, mod - 2, mod) % mod}; }
void operator += (const Num & b) {if((a += b.a) >= mod) a -= mod;}
void operator -= (const Num & b) {if((a -= b.a) < 0) a += mod;}
void operator *= (const Num & b) { a = a * b.a % mod; }
void operator /= (const Num & b) { a = a * fastpo(b.a, mod - 2, mod) % mod; }
void operator = (const Num & b) { a = b.a; }
void operator = (const LL & b) { a = b; }
};
template<LL mod> ostream & operator << (ostream & os, const Num<mod> & a) {
os << a.a;
return os;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
inline string itoa(LL x, int width = 0) {
string res;
if(x == 0) res.push_back('0');
while(x) {
res.push_back('0' + x % 10);
x /= 10;
}
while((int)res.size() < width) res.push_back('0');
reverse(res.begin(), res.end());
return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
fwrite(buf, 1, _bl, stdout);
_bl = 0;
}
__inline void _putchar(char c) {
if(_bl == _B) flush();
buf[_bl++] = c;
}
inline void print(LL x, char c) {
static char tmp[20];
int l = 0;
if(!x) tmp[l++] = '0';
else {
while(x) {
tmp[l++] = x % 10 + '0';
x /= 10;
}
}
for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
_putchar(c);
}
typedef double C;
struct P {
C x, y;
void scan() {
double _x, _y;
scanf("%lf%lf", &_x, &_y);
x = _x; y = _y;
}
void print() {
cout << '(' << x << ' ' << y << ')' << endl;
}
P operator + (const P & b) const { return P{x + b.x, y + b.y}; }
P operator - (const P & b) const { return P{x - b.x, y - b.y}; }
C operator * (const P & b) const { return x * b.y - y * b.x; }
C operator % (const P & b) const { return x * b.x + y * b.y; }
};
P operator * (const C & x, const P & b) { return P{x * b.x, x * b.y}; }
const int N = 300033;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int rela[N];
int getr(int x) {
int p = x;
while(rela[p] != p) p = rela[p];
int p1 = p; p = x;
while(rela[p] != p) {
int p2 = rela[p];
rela[p] = p1;
p = p2;
}
return p1;
}
int ans[N], l[N], r[N], c[N], h[N];
LL mn[N * 4];
LL delta[N * 4];
vector<pair<LL, int> > qu[N];
void pushdown(int k) {
delta[k * 2] += delta[k];
delta[k * 2 + 1] += delta[k];
mn[k * 2] += delta[k];
mn[k * 2 + 1] += delta[k];
delta[k] = 0;
}
void collect(int k) {
assert(delta[k] == 0);
mn[k] = min(mn[k * 2], mn[k * 2 + 1]);
}
void build(int k, int le, int ri) {
if(le == ri) {
mn[k] = qu[le].back().fi;
}else {
int mid = (le + ri) / 2;
build(k * 2, le, mid);
build(k * 2 + 1, mid + 1, ri);
collect(k);
}
}
void fill(int k, int le, int ri, int ql, int qr, int col, int hei) {
//cout << le << ' ' << ri << ' ' << col << ' ' << hei << endl;
if(ql <= le && ri <= qr) {
//cout << le << ' ' << ri << ' ' << col << ' ' << hei << endl;
mn[k] -= hei;
delta[k] -= hei;
//cout << le << ' ' << mn[k] << endl;
}else {
int mid = (le + ri) / 2;
pushdown(k);
if(ql <= mid) fill(k * 2, le, mid, ql, qr, col, hei);
if(qr >= mid + 1) fill(k * 2 + 1, mid + 1, ri, ql, qr, col, hei);
collect(k);
//cout << mn[k * 2 + 1] << ' ' << mn[k * 2] << ' ' << mn[k] << endl;
}
}
int I;
void getmin(int k, int le, int ri) {
if(mn[k] > 0) return;
if(le == ri) {
while(mn[k] <= 0) {
ans[qu[le].back().se] = I;
mn[k] -= qu[le].back().fi;
qu[le].pop_back();
mn[k] += qu[le].back().fi;
}
}else {
int mid = (le + ri) / 2;
pushdown(k);
getmin(k * 2, le, mid);
getmin(k * 2 + 1, mid + 1, ri);
collect(k);
}
}
int main() {
int n, k, q;
scanf("%d%d%d", &n, &k, &q);
for(int i = 1; i <= k; i++) {
scanf("%d%d%d%d", &l[i], &r[i], &c[i], &h[i]);
}
for(int i = 1; i <= q; i++) {
int x;
LL y;
scanf("%d%lld", &x, &y);
qu[x].pb({y, i});
}
for(int i = 1; i <= n; i++) {
qu[i].pb({inf * (LL)inf, 0});
sort(all(qu[i]));
reverse(all(qu[i]));
}
for(int i = 1; i <= q; i++) {
ans[i] = -1;
}
build(1, 1, n);
//cout << mn[1] << endl;
for(int i = 1; i <= k; i++) {
I = c[i];
fill(1, 1, n, l[i], r[i], c[i], h[i]);
//cout << mn[1] << endl;
getmin(1, 1, n);
}
for(int i = 1; i <= q; i++) {
printf("%d\n", ans[i]);
}
}