oj.uz

답안 #131678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131678 2019-07-17T12:40:58 Z ekrem Examination (JOI19_examination) C++
43 / 100
 2478 ms 214136 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define orta ((bas+son)/2)
#define mod 1000000007
#define inf 1000000009
#define LOGN 30
#define N 100005
#define M N * LOGN * LOGN
using namespace std;

typedef long long ll;
typedef pair < int , int > ii;

int n, m, k, q, say1 = 1, say2, seg1[N * LOGN], sol1[N * LOGN], sag1[N * LOGN], seg2[M], sol2[M], sag2[M],  bs[M], sn[M], ans[N];
pair < int , ii > a[N];
pair < ii , ii > b[N];

int ver(int k){return seg1[k] = (!seg1[k])?++say2:seg1[k];}
int solver1(int k){return sol1[k] = (!sol1[k])?++say1:sol1[k];}
int sagver1(int k){return sag1[k] = (!sag1[k])?++say1:sag1[k];}
int solver2(int k){return sol2[k] = (!sol2[k])?++say2:sol2[k];}
int sagver2(int k){return sag2[k] = (!sag2[k])?++say2:sag2[k];}

void up2(int k, int bas, int son, int x){
	if(bas == son){
		seg2[k]++;
		return;
	}
	if(x <= orta)
		up2(solver2(k), bas, orta, x);
	else
		up2(sagver2(k), orta + 1, son, x);
	seg2[k] = seg2[sol2[k]] + seg2[sag2[k]];
}

void up1(int k, int bas, int son, int x, int y){
	if(bas == son){
		up2(ver(k), 1, m, y);
		// cout << bas << " " << son << " " << ver(k) << " a " << y << " artti" << endl;
		return;
	}
	if(x <= orta)
		up1(solver1(k), bas, orta, x, y);
	else
		up1(sagver1(k), orta + 1, son, x, y);
	// cout << bas << " " << son << " " << ver(k) << " a " << y << " artti" << endl;
	up2(ver(k), 1, m, y);
}

int qu2(int k, int bas, int son, int x){
	if(!k or son < x)
		return 0;
	if(bas >= x)
		return seg2[k];
	return qu2(sol2[k], bas, orta, x) + qu2(sag2[k], orta + 1, son, x);
}

int qu1(int k, int bas, int son, int x, int y){
	if(!k or son < x)
		return 0;
	if(bas >= x){
		// cout << bas << " " << son << " " << seg1[k] << " " << y << " = " << qu2(seg1[k], 1, m, y) << endl;
		return qu2(seg1[k], 1, m, y);
	}
	return qu1(sol1[k], bas, orta, x, y) + qu1(sag1[k], orta + 1, son, x, y);
}

int ne[N], nee[N];
map < int , int > h, hh, x, xx;
map < int , int > :: iterator it;

int main(){
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%d %d",&k ,&q);
	for(int i = 1; i <= k; i++){
		scanf("%d %d",&a[i].nd.st ,&a[i].nd.nd);
		a[i].st = a[i].nd.st + a[i].nd.nd;
		h[a[i].nd.st] = 1;
		hh[a[i].nd.nd] = 1;
	}
	sort(a + 1, a + k + 1);
	for(int i = 1; i <= q; i++){
		scanf("%d %d %d" ,&b[i].nd.st ,&b[i].nd.nd,&b[i].st.st);
		h[b[i].nd.st] = 1;
		hh[b[i].nd.nd] = 1;
		b[i].st.nd = i;
	}
	for(it = h.begin(); it != h.end(); it++){
		x[it->st] = ++n;
		ne[n] = it->st;
	}

	for(it = hh.begin(); it != hh.end(); it++){
		xx[it->st] = ++m;
		nee[n] = it->st;
	}
	// cout << n << " " << m << endl;
	sort(b + 1, b + q + 1);
	reverse(b + 1, b + q + 1);
	for(int i = 1; i <= q; i++){
		while(k >= 1 and a[k].st >= b[i].st.st){
			// cout << ne[a[k].nd.st] << " " << nee[a[k].nd.nd] << " geldi" << endl << endl;
			up1(1, 1, n, x[a[k].nd.st], xx[a[k].nd.nd]);
			k--;
		}
		// cout << b[i].st.nd << " icin bul " << n << " " << m << endl;
		ans[b[i].st.nd] = qu1(1, 1, n, x[b[i].nd.st], xx[b[i].nd.nd] );
	}
	for(int i = 1; i <= q; i++)
		printf("%d\n", ans[i]);
	return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:78:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&k ,&q);
  ~~~~~^~~~~~~~~~~~~~~~
examination.cpp:80:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&a[i].nd.st ,&a[i].nd.nd);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d" ,&b[i].nd.st ,&b[i].nd.nd,&b[i].st.st);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 32 ms 5980 KB Output is correct
8 Correct 30 ms 6008 KB Output is correct
9 Correct 29 ms 5980 KB Output is correct
10 Correct 12 ms 1976 KB Output is correct
11 Correct 12 ms 1784 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 31 ms 5884 KB Output is correct
14 Correct 29 ms 5880 KB Output is correct
15 Correct 30 ms 6008 KB Output is correct
16 Correct 9 ms 1276 KB Output is correct
17 Correct 10 ms 1400 KB Output is correct
18 Correct 5 ms 508 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2478 ms 213400 KB Output is correct
2 Correct 2462 ms 213696 KB Output is correct
3 Correct 2467 ms 213432 KB Output is correct
4 Correct 464 ms 31716 KB Output is correct
5 Correct 486 ms 29568 KB Output is correct
6 Correct 98 ms 5112 KB Output is correct
7 Correct 2343 ms 202772 KB Output is correct
8 Correct 2190 ms 203260 KB Output is correct
9 Correct 1946 ms 193016 KB Output is correct
10 Correct 322 ms 17240 KB Output is correct
11 Correct 433 ms 18272 KB Output is correct
12 Correct 70 ms 4728 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2478 ms 213400 KB Output is correct
2 Correct 2462 ms 213696 KB Output is correct
3 Correct 2467 ms 213432 KB Output is correct
4 Correct 464 ms 31716 KB Output is correct
5 Correct 486 ms 29568 KB Output is correct
6 Correct 98 ms 5112 KB Output is correct
7 Correct 2343 ms 202772 KB Output is correct
8 Correct 2190 ms 203260 KB Output is correct
9 Correct 1946 ms 193016 KB Output is correct
10 Correct 322 ms 17240 KB Output is correct
11 Correct 433 ms 18272 KB Output is correct
12 Correct 70 ms 4728 KB Output is correct
13 Correct 2175 ms 213980 KB Output is correct
14 Correct 2307 ms 213980 KB Output is correct
15 Correct 2334 ms 213368 KB Output is correct
16 Correct 445 ms 31944 KB Output is correct
17 Correct 436 ms 29816 KB Output is correct
18 Correct 109 ms 5112 KB Output is correct
19 Correct 2141 ms 213992 KB Output is correct
20 Correct 2333 ms 214136 KB Output is correct
21 Correct 1907 ms 206416 KB Output is correct
22 Correct 321 ms 17272 KB Output is correct
23 Correct 343 ms 18168 KB Output is correct
24 Correct 69 ms 4856 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 32 ms 5980 KB Output is correct
8 Correct 30 ms 6008 KB Output is correct
9 Correct 29 ms 5980 KB Output is correct
10 Correct 12 ms 1976 KB Output is correct
11 Correct 12 ms 1784 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 31 ms 5884 KB Output is correct
14 Correct 29 ms 5880 KB Output is correct
15 Correct 30 ms 6008 KB Output is correct
16 Correct 9 ms 1276 KB Output is correct
17 Correct 10 ms 1400 KB Output is correct
18 Correct 5 ms 508 KB Output is correct
19 Correct 2478 ms 213400 KB Output is correct
20 Correct 2462 ms 213696 KB Output is correct
21 Correct 2467 ms 213432 KB Output is correct
22 Correct 464 ms 31716 KB Output is correct
23 Correct 486 ms 29568 KB Output is correct
24 Correct 98 ms 5112 KB Output is correct
25 Correct 2343 ms 202772 KB Output is correct
26 Correct 2190 ms 203260 KB Output is correct
27 Correct 1946 ms 193016 KB Output is correct
28 Correct 322 ms 17240 KB Output is correct
29 Correct 433 ms 18272 KB Output is correct
30 Correct 70 ms 4728 KB Output is correct
31 Correct 2175 ms 213980 KB Output is correct
32 Correct 2307 ms 213980 KB Output is correct
33 Correct 2334 ms 213368 KB Output is correct
34 Correct 445 ms 31944 KB Output is correct
35 Correct 436 ms 29816 KB Output is correct
36 Correct 109 ms 5112 KB Output is correct
37 Correct 2141 ms 213992 KB Output is correct
38 Correct 2333 ms 214136 KB Output is correct
39 Correct 1907 ms 206416 KB Output is correct
40 Correct 321 ms 17272 KB Output is correct
41 Correct 343 ms 18168 KB Output is correct
42 Correct 69 ms 4856 KB Output is correct
43 Runtime error 1402 ms 173496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Halted 0 ms 0 KB -