oj.uz

답안 #22748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22748 2017-04-30T07:12:55 Z 크리콘 B번 문제는 그리디로 풀려요(#918, imsifile) Donut-shaped Enclosure (KRIII5_DE) C++
0 / 7
 9 ms 17220 KB 
#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
#define lb(y) (lower_bound(ys, ys+ycn, y) - ys)
using namespace std;

typedef long long lld;

struct intv {
	lld x, yl, yr; int sco;
	intv(lld x_=0, lld yl_=0, lld yr_=0, int sco_=0){ x=x_, yl=yl_, yr=yr_, sco=sco_; }
	bool operator< (const intv& c) const {
		if(x == c.x)return sco < c.sco;
		return x<c.x;
	}
} ba[404000];

struct iix {
	int sum, mx;
	iix(int sum_=0, int mx_=0) : sum(sum_), mx(mx_) {}
};

struct segtr {
	segtr *l, *r; int s, e;
	iix key;
	segtr(int s_=0, int e_=0) : s(s_), e(e_) {l=NULL, r=NULL;}
} *itr;

int N, bcn, dap, ycn;
lld L, R, ys[404040];

void add(segtr* it, int mi, int mx, int v){
	if(mi > mx)return;
	int l = it->s, r = it->e;
	int m = (l+r)/2;
	if(m == r && l < m)m--;
//	printf("%lld %lld %lld / %lld %lld\n", l, m, r, mi, mx);
	if(l == -1 && r == -1 && mi == 0)exit(0);
	if(l == mi && r == mx){
		it->key.sum += v;
		it->key.mx += v;
		return;
	}
	if(it->l == NULL)it->l = new segtr(l, m);
	if(it->r == NULL)it->r = new segtr(m+1, r);

	if(mx <= m) add(it->l, mi, mx, v);
	else if(mi > m) add(it->r, mi, mx, v);
	else{
		add(it->l, mi, m, v);
		add(it->r, m+1, mx, v);
	}
	it->key.mx = max(it->l->key.mx, it->r->key.mx) + it->key.sum;
}

int main(){
	itr = new segtr;
	itr->s = 0, itr->e = 500000;
	scanf("%d %lld %lld", &N, &L, &R); L--;
	for(int i=0; i<N; i++){
		lld x, y; int s;
		scanf("%lld%lld%d", &x, &y, &s);
		ba[bcn++] = intv(x-R, y-R, y+R, s);
		ba[bcn++] = intv(x-L, y-L, y+L, -s);
		ba[bcn++] = intv(x+L+1, y-L, y+L, s);
		ba[bcn++] = intv(x+R+1, y-R, y+R, -s);
		ys[ycn++] = y-L, ys[ycn++] = y+L;
		ys[ycn++] = y-R, ys[ycn++] = y+R;
	}
	sort(ba, ba+bcn);
	sort(ys, ys+ycn); ycn = unique(ys, ys+ycn) - ys;
	for(int i=0; i<bcn; i++){
		add(itr, lb(ba[i].yl), lb(ba[i].yr), ba[i].sco);
		int mx = itr->key.mx;
		if(dap < mx)dap = mx;
	}
	printf("%d", dap);
	return 0;
}

Compilation message

DE.cpp: In function 'int main()':
DE.cpp:59:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %lld %lld", &N, &L, &R); L--;
                                   ^
DE.cpp:62:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%d", &x, &y, &s);
                                  ^

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 16956 KB Output is correct
2 Correct 0 ms 16956 KB Output is correct
3 Correct 0 ms 16956 KB Output is correct
4 Correct 3 ms 16956 KB Output is correct
5 Correct 3 ms 16956 KB Output is correct
6 Correct 6 ms 17088 KB Output is correct
7 Correct 0 ms 17088 KB Output is correct
8 Correct 3 ms 17088 KB Output is correct
9 Correct 3 ms 17088 KB Output is correct
10 Correct 9 ms 17088 KB Output is correct
11 Correct 6 ms 17088 KB Output is correct
12 Correct 6 ms 17220 KB Output is correct
13 Correct 3 ms 17088 KB Output is correct
14 Incorrect 6 ms 17088 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 16956 KB Output is correct
2 Correct 0 ms 16956 KB Output is correct
3 Correct 0 ms 16956 KB Output is correct
4 Correct 3 ms 16956 KB Output is correct
5 Correct 3 ms 16956 KB Output is correct
6 Correct 6 ms 17088 KB Output is correct
7 Correct 0 ms 17088 KB Output is correct
8 Correct 3 ms 17088 KB Output is correct
9 Correct 3 ms 17088 KB Output is correct
10 Correct 9 ms 17088 KB Output is correct
11 Correct 6 ms 17088 KB Output is correct
12 Correct 6 ms 17220 KB Output is correct
13 Correct 3 ms 17088 KB Output is correct
14 Incorrect 6 ms 17088 KB Output isn't correct
15 Halted 0 ms 0 KB -