oj.uz

Submission #117788

# Submission time Handle Problem Language Result Execution time Memory
117788 2019-06-17T07:57:52 Z 김세빈(#2878) Tenis (COI19_tenis) C++14
100 / 100
 277 ms 8208 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> pii;

struct seg{
	pii T[303030];
	int L[303030];

	void init(int p, int s, int e)
	{
		if(s == e){
			T[p] = pii(0, s);
			return;
		}
		else{
			init(p << 1, s, s + e >> 1);
			init(p << 1 | 1, (s + e >> 1) + 1, e);
			T[p] = max(T[p << 1], T[p << 1 | 1]);
		}
	}

	void update(int p, int s, int e, int l, int r, int v)
	{
		if(e < l || r < s) return;
		else if(l <= s && e <= r){
			L[p] -= v; T[p].first -= v;
			return;
		}

		update(p << 1, s, s + e >> 1, l, r, v);
		update(p << 1 | 1, (s + e >> 1) + 1, e, l, r, v);

		T[p] = max(T[p << 1], T[p << 1 | 1]);
		T[p].first += L[p];
	}

	int find(int p, int s, int e, int c, int v)
	{
		if(s == e){
			if(T[p].first + v == 0) return s;
			else return -1;
		}
		else if(c <= (s + e >> 1)) return find(p << 1, s, s + e >> 1, c, v + L[p]);
		else{
			int ret = find(p << 1 | 1, (s + e >> 1) + 1, e, c, v + L[p]);
			if(ret == -1 && T[p << 1].first + v + L[p] == 0) ret = T[p << 1].second;
			return ret;
		}
	}
};

seg T;
int A[3][101010];
int n;

void update(int x, int v)
{
	int l, r;
	l = min(min(A[0][x], A[1][x]), A[2][x]);
	r = max(max(A[0][x], A[1][x]), A[2][x]);
	if(l < r) T.update(1, 1, n, l + 1, r, v);
}

int main()
{
	int q, i, j, t, x, y;

	scanf("%d%d", &n, &q);
	
	for(i=0; i<=2; i++){
		for(j=1; j<=n; j++){
			scanf("%d", &x);
			A[i][x] = j;
		}
	}

	T.init(1, 1, n);

	for(i=1; i<=n; i++){
		update(i, 1);
	}

	for(; q--; ){
		scanf("%d", &t);
		if(t == 1){
			scanf("%d", &x);
			printf("%s\n", T.find(1, 1, n, A[0][x], 0) == 1? "DA" : "NE");
		}
		else{
			scanf("%d%d%d", &t, &x, &y); t --;
			update(x, -1); update(y, -1);
			swap(A[t][x], A[t][y]);
			update(x, 1); update(y, 1);
		}
	}

	return 0;
}

Compilation message

tenis.cpp: In member function 'void seg::init(int, int, int)':
tenis.cpp:18:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    init(p << 1, s, s + e >> 1);
                    ~~^~~
tenis.cpp:19:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    init(p << 1 | 1, (s + e >> 1) + 1, e);
                      ~~^~~
tenis.cpp: In member function 'void seg::update(int, int, int, int, int, int)':
tenis.cpp:32:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   update(p << 1, s, s + e >> 1, l, r, v);
                     ~~^~~
tenis.cpp:33:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   update(p << 1 | 1, (s + e >> 1) + 1, e, l, r, v);
                       ~~^~~
tenis.cpp: In member function 'int seg::find(int, int, int, int, int)':
tenis.cpp:45:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   else if(c <= (s + e >> 1)) return find(p << 1, s, s + e >> 1, c, v + L[p]);
                 ~~^~~
tenis.cpp:45:55: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   else if(c <= (s + e >> 1)) return find(p << 1, s, s + e >> 1, c, v + L[p]);
                                                     ~~^~~
tenis.cpp:47:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int ret = find(p << 1 | 1, (s + e >> 1) + 1, e, c, v + L[p]);
                                ~~^~~
tenis.cpp: In function 'int main()':
tenis.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &q);
  ~~~~~^~~~~~~~~~~~~~~~
tenis.cpp:74:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &x);
    ~~~~~^~~~~~~~~~
tenis.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &t);
   ~~~~~^~~~~~~~~~
tenis.cpp:88:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &x);
    ~~~~~^~~~~~~~~~
tenis.cpp:92:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%d", &t, &x, &y); t --;
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 4 ms 2660 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 5 ms 2688 KB Output is correct
12 Correct 4 ms 2688 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 4 ms 2660 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 5 ms 2688 KB Output is correct
12 Correct 4 ms 2688 KB Output is correct
13 Correct 82 ms 4992 KB Output is correct
14 Correct 99 ms 4972 KB Output is correct
15 Correct 79 ms 4908 KB Output is correct
16 Correct 86 ms 4856 KB Output is correct
17 Correct 72 ms 4856 KB Output is correct
18 Correct 74 ms 4856 KB Output is correct
19 Correct 74 ms 4856 KB Output is correct
20 Correct 91 ms 4856 KB Output is correct
21 Correct 70 ms 4856 KB Output is correct
22 Correct 82 ms 4984 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 5368 KB Output is correct
2 Correct 150 ms 5516 KB Output is correct
3 Correct 131 ms 5360 KB Output is correct
4 Correct 134 ms 5368 KB Output is correct
5 Correct 150 ms 5368 KB Output is correct
6 Correct 132 ms 5340 KB Output is correct
7 Correct 131 ms 5324 KB Output is correct
8 Correct 134 ms 5240 KB Output is correct
9 Correct 147 ms 5344 KB Output is correct
10 Correct 139 ms 5496 KB Output is correct
11 Correct 149 ms 5356 KB Output is correct
12 Correct 140 ms 5368 KB Output is correct
13 Correct 146 ms 5368 KB Output is correct
14 Correct 147 ms 5368 KB Output is correct
15 Correct 143 ms 5496 KB Output is correct

Subtask #5
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 4 ms 2660 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 5 ms 2688 KB Output is correct
12 Correct 4 ms 2688 KB Output is correct
13 Correct 82 ms 4992 KB Output is correct
14 Correct 99 ms 4972 KB Output is correct
15 Correct 79 ms 4908 KB Output is correct
16 Correct 86 ms 4856 KB Output is correct
17 Correct 72 ms 4856 KB Output is correct
18 Correct 74 ms 4856 KB Output is correct
19 Correct 74 ms 4856 KB Output is correct
20 Correct 91 ms 4856 KB Output is correct
21 Correct 70 ms 4856 KB Output is correct
22 Correct 82 ms 4984 KB Output is correct
23 Correct 140 ms 5368 KB Output is correct
24 Correct 150 ms 5516 KB Output is correct
25 Correct 131 ms 5360 KB Output is correct
26 Correct 134 ms 5368 KB Output is correct
27 Correct 150 ms 5368 KB Output is correct
28 Correct 132 ms 5340 KB Output is correct
29 Correct 131 ms 5324 KB Output is correct
30 Correct 134 ms 5240 KB Output is correct
31 Correct 147 ms 5344 KB Output is correct
32 Correct 139 ms 5496 KB Output is correct
33 Correct 149 ms 5356 KB Output is correct
34 Correct 140 ms 5368 KB Output is correct
35 Correct 146 ms 5368 KB Output is correct
36 Correct 147 ms 5368 KB Output is correct
37 Correct 143 ms 5496 KB Output is correct
38 Correct 252 ms 8208 KB Output is correct
39 Correct 164 ms 7800 KB Output is correct
40 Correct 277 ms 8156 KB Output is correct
41 Correct 163 ms 7880 KB Output is correct
42 Correct 165 ms 7928 KB Output is correct
43 Correct 238 ms 8056 KB Output is correct
44 Correct 156 ms 8056 KB Output is correct
45 Correct 180 ms 7856 KB Output is correct
46 Correct 155 ms 7800 KB Output is correct
47 Correct 243 ms 7928 KB Output is correct
48 Correct 164 ms 7820 KB Output is correct
49 Correct 163 ms 7928 KB Output is correct
50 Correct 149 ms 7800 KB Output is correct
51 Correct 163 ms 7900 KB Output is correct
52 Correct 221 ms 8028 KB Output is correct
53 Correct 158 ms 7800 KB Output is correct
54 Correct 159 ms 7876 KB Output is correct
55 Correct 167 ms 7956 KB Output is correct
56 Correct 152 ms 7800 KB Output is correct
57 Correct 156 ms 7912 KB Output is correct
58 Correct 194 ms 7876 KB Output is correct