oj.uz

답안 #22770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22770 2017-04-30T07:21:31 Z 크리콘 B번 문제는 그리디로 풀려요(#918, imsifile) Donut-shaped Enclosure (KRIII5_DE) C++
2 / 7
 1500 ms 419996 KB 
#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;

typedef long long lld;
const lld MINF = -2000000000;

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 {
	int l, r; lld s, e;
	iix key;
	segtr(lld s_=0, lld e_=0) : s(s_), e(e_) {l=NULL, r=NULL;}
} itr[13000000];

int N, bcn, dap; int icn;
lld L, R;

void add(int it, lld mi, lld mx, int v){
	if(mi > mx)return;
	lld l = itr[it].s, r = itr[it].e;
	lld m = ((l-MINF)+(r-MINF))/2 + MINF;
	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){
		itr[it].key.sum += v;
		itr[it].key.mx += v;
		return;
	}
	if(itr[it].l == 0)itr[it].l = icn++, itr[itr[it].l] = segtr(l, m);
	if(itr[it].r == 0)itr[it].r = icn++, itr[itr[it].r] = segtr(m+1, r);

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

int main(){
	icn++;
	itr[0].s = -2000000000, itr[0].e = 2000000000;
	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);
	}
	sort(ba, ba+bcn);
	for(int i=0; i<bcn; i++){
		add(0, ba[i].yl, ba[i].yr, ba[i].sco);
		int mx = itr[0].key.mx;
		if(dap < mx)dap = mx;
	}
	printf("%d", dap);
	return 0;
}

Compilation message

DE.cpp: In constructor 'segtr::segtr(lld, lld)':
DE.cpp:26:45: warning: converting to non-pointer type 'int' from NULL [-Wconversion-null]
  segtr(lld s_=0, lld e_=0) : s(s_), e(e_) {l=NULL, r=NULL;}
                                             ^
DE.cpp:26:53: warning: converting to non-pointer type 'int' from NULL [-Wconversion-null]
  segtr(lld s_=0, lld e_=0) : s(s_), e(e_) {l=NULL, r=NULL;}
                                                     ^
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
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 419996 KB Output is correct
2 Correct 59 ms 419996 KB Output is correct
3 Correct 36 ms 419996 KB Output is correct
4 Correct 79 ms 419996 KB Output is correct
5 Correct 56 ms 419996 KB Output is correct
6 Correct 39 ms 419996 KB Output is correct
7 Correct 63 ms 419996 KB Output is correct
8 Correct 49 ms 419996 KB Output is correct
9 Correct 73 ms 419996 KB Output is correct
10 Correct 83 ms 419996 KB Output is correct
11 Correct 69 ms 419996 KB Output is correct
12 Correct 49 ms 419996 KB Output is correct
13 Correct 76 ms 419996 KB Output is correct
14 Correct 66 ms 419996 KB Output is correct
15 Correct 56 ms 419996 KB Output is correct
16 Correct 46 ms 419996 KB Output is correct
17 Correct 46 ms 419996 KB Output is correct
18 Correct 86 ms 419996 KB Output is correct
19 Correct 66 ms 419996 KB Output is correct
20 Correct 69 ms 419996 KB Output is correct
21 Correct 63 ms 419996 KB Output is correct
22 Correct 63 ms 419996 KB Output is correct
23 Correct 56 ms 419996 KB Output is correct
24 Correct 86 ms 419996 KB Output is correct
25 Correct 56 ms 419996 KB Output is correct
26 Correct 56 ms 419996 KB Output is correct
27 Correct 59 ms 419996 KB Output is correct
28 Correct 63 ms 419996 KB Output is correct
29 Correct 66 ms 419996 KB Output is correct
30 Correct 49 ms 419996 KB Output is correct
31 Correct 69 ms 419996 KB Output is correct
32 Correct 73 ms 419996 KB Output is correct
33 Correct 63 ms 419996 KB Output is correct
34 Correct 69 ms 419996 KB Output is correct
35 Correct 79 ms 419996 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 419996 KB Output is correct
2 Correct 59 ms 419996 KB Output is correct
3 Correct 36 ms 419996 KB Output is correct
4 Correct 79 ms 419996 KB Output is correct
5 Correct 56 ms 419996 KB Output is correct
6 Correct 39 ms 419996 KB Output is correct
7 Correct 63 ms 419996 KB Output is correct
8 Correct 49 ms 419996 KB Output is correct
9 Correct 73 ms 419996 KB Output is correct
10 Correct 83 ms 419996 KB Output is correct
11 Correct 69 ms 419996 KB Output is correct
12 Correct 49 ms 419996 KB Output is correct
13 Correct 76 ms 419996 KB Output is correct
14 Correct 66 ms 419996 KB Output is correct
15 Correct 56 ms 419996 KB Output is correct
16 Correct 46 ms 419996 KB Output is correct
17 Correct 46 ms 419996 KB Output is correct
18 Correct 86 ms 419996 KB Output is correct
19 Correct 66 ms 419996 KB Output is correct
20 Correct 69 ms 419996 KB Output is correct
21 Correct 63 ms 419996 KB Output is correct
22 Correct 63 ms 419996 KB Output is correct
23 Correct 56 ms 419996 KB Output is correct
24 Correct 86 ms 419996 KB Output is correct
25 Correct 56 ms 419996 KB Output is correct
26 Correct 56 ms 419996 KB Output is correct
27 Correct 59 ms 419996 KB Output is correct
28 Correct 63 ms 419996 KB Output is correct
29 Correct 66 ms 419996 KB Output is correct
30 Correct 49 ms 419996 KB Output is correct
31 Correct 69 ms 419996 KB Output is correct
32 Correct 73 ms 419996 KB Output is correct
33 Correct 63 ms 419996 KB Output is correct
34 Correct 69 ms 419996 KB Output is correct
35 Correct 79 ms 419996 KB Output is correct
36 Correct 63 ms 419996 KB Output is correct
37 Correct 63 ms 419996 KB Output is correct
38 Correct 66 ms 419996 KB Output is correct
39 Correct 76 ms 419996 KB Output is correct
40 Correct 103 ms 419996 KB Output is correct
41 Correct 109 ms 419996 KB Output is correct
42 Correct 143 ms 419996 KB Output is correct
43 Correct 179 ms 419996 KB Output is correct
44 Correct 183 ms 419996 KB Output is correct
45 Correct 196 ms 419996 KB Output is correct
46 Correct 196 ms 419996 KB Output is correct
47 Correct 216 ms 419996 KB Output is correct
48 Correct 356 ms 419996 KB Output is correct
49 Correct 773 ms 419996 KB Output is correct
50 Correct 876 ms 419996 KB Output is correct
51 Execution timed out 1500 ms 419996 KB Execution timed out
52 Halted 0 ms 0 KB -