oj.uz

답안 #131641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131641 2019-07-17T10:58:47 Z ekrem Examination (JOI19_examination) C++
43 / 100
 3000 ms 860280 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 = 1, m = 1, k, q, say1 = 1, say2, seg1[N * LOGN], sol1[N * LOGN], sag1[N * LOGN], seg2[M], sol2[M], sag2[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 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;
		a[i].nd.st++;a[i].nd.nd++;
		n = max(n, a[i].nd.st);
		m = max(m, a[i].nd.nd);
	}
	n++;m++;
	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);
		b[i].nd.st++;b[i].nd.nd++;
		b[i].st.nd = i;
	}
	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 << a[k].nd.st << " " << a[k].nd.nd << " geldi" << endl << endl;
			up1(1, 1, n, a[k].nd.st, a[k].nd.nd);
			k--;
		}
		// cout << b[i].st.nd << " icin bul " << n << " " << m << endl;
		ans[b[i].st.nd] = qu1(1, 1, n, min(n, b[i].nd.st), min(m, 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:74: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:76: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:85: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 3 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 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 74 ms 32376 KB Output is correct
8 Correct 74 ms 32504 KB Output is correct
9 Correct 74 ms 32376 KB Output is correct
10 Correct 14 ms 4856 KB Output is correct
11 Correct 14 ms 4088 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 82 ms 32372 KB Output is correct
14 Correct 76 ms 32376 KB Output is correct
15 Correct 75 ms 32320 KB Output is correct
16 Correct 9 ms 1912 KB Output is correct
17 Correct 10 ms 2168 KB Output is correct
18 Correct 4 ms 504 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1740 ms 204876 KB Output is correct
2 Correct 1843 ms 204724 KB Output is correct
3 Correct 1845 ms 204760 KB Output is correct
4 Correct 252 ms 24824 KB Output is correct
5 Correct 250 ms 23032 KB Output is correct
6 Correct 87 ms 5112 KB Output is correct
7 Correct 1703 ms 204800 KB Output is correct
8 Correct 1680 ms 204704 KB Output is correct
9 Correct 1585 ms 204580 KB Output is correct
10 Correct 122 ms 9336 KB Output is correct
11 Correct 139 ms 9968 KB Output is correct
12 Correct 58 ms 4768 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1740 ms 204876 KB Output is correct
2 Correct 1843 ms 204724 KB Output is correct
3 Correct 1845 ms 204760 KB Output is correct
4 Correct 252 ms 24824 KB Output is correct
5 Correct 250 ms 23032 KB Output is correct
6 Correct 87 ms 5112 KB Output is correct
7 Correct 1703 ms 204800 KB Output is correct
8 Correct 1680 ms 204704 KB Output is correct
9 Correct 1585 ms 204580 KB Output is correct
10 Correct 122 ms 9336 KB Output is correct
11 Correct 139 ms 9968 KB Output is correct
12 Correct 58 ms 4768 KB Output is correct
13 Correct 1542 ms 204164 KB Output is correct
14 Correct 1734 ms 204684 KB Output is correct
15 Correct 1681 ms 204964 KB Output is correct
16 Correct 238 ms 25148 KB Output is correct
17 Correct 230 ms 23272 KB Output is correct
18 Correct 98 ms 5112 KB Output is correct
19 Correct 1522 ms 204424 KB Output is correct
20 Correct 1614 ms 204536 KB Output is correct
21 Correct 1366 ms 204464 KB Output is correct
22 Correct 122 ms 9252 KB Output is correct
23 Correct 141 ms 9976 KB Output is correct
24 Correct 58 ms 4732 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 74 ms 32376 KB Output is correct
8 Correct 74 ms 32504 KB Output is correct
9 Correct 74 ms 32376 KB Output is correct
10 Correct 14 ms 4856 KB Output is correct
11 Correct 14 ms 4088 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 82 ms 32372 KB Output is correct
14 Correct 76 ms 32376 KB Output is correct
15 Correct 75 ms 32320 KB Output is correct
16 Correct 9 ms 1912 KB Output is correct
17 Correct 10 ms 2168 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 1740 ms 204876 KB Output is correct
20 Correct 1843 ms 204724 KB Output is correct
21 Correct 1845 ms 204760 KB Output is correct
22 Correct 252 ms 24824 KB Output is correct
23 Correct 250 ms 23032 KB Output is correct
24 Correct 87 ms 5112 KB Output is correct
25 Correct 1703 ms 204800 KB Output is correct
26 Correct 1680 ms 204704 KB Output is correct
27 Correct 1585 ms 204580 KB Output is correct
28 Correct 122 ms 9336 KB Output is correct
29 Correct 139 ms 9968 KB Output is correct
30 Correct 58 ms 4768 KB Output is correct
31 Correct 1542 ms 204164 KB Output is correct
32 Correct 1734 ms 204684 KB Output is correct
33 Correct 1681 ms 204964 KB Output is correct
34 Correct 238 ms 25148 KB Output is correct
35 Correct 230 ms 23272 KB Output is correct
36 Correct 98 ms 5112 KB Output is correct
37 Correct 1522 ms 204424 KB Output is correct
38 Correct 1614 ms 204536 KB Output is correct
39 Correct 1366 ms 204464 KB Output is correct
40 Correct 122 ms 9252 KB Output is correct
41 Correct 141 ms 9976 KB Output is correct
42 Correct 58 ms 4732 KB Output is correct
43 Execution timed out 3121 ms 860280 KB Time limit exceeded
44 Halted 0 ms 0 KB -