oj.uz

Submission #117785

# Submission time Handle Problem Language Result Execution time Memory
117785 2019-06-17T07:55:14 Z 김세빈(#2878) Tenis (COI19_tenis) C++14
30 / 100
 88 ms 6008 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 = min(A[1][x], A[2][x]);
	int r = A[0][x];
	if(l > r) swap(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);

	if(q > 10){
		return 0;
	}

	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:78:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &x);
    ~~~~~^~~~~~~~~~
tenis.cpp:90:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &t);
   ~~~~~^~~~~~~~~~
tenis.cpp:92:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &x);
    ~~~~~^~~~~~~~~~
tenis.cpp:96: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 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2716 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2716 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 4 ms 2816 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 4 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 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2716 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 4 ms 2816 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 4 ms 2688 KB Output is correct
12 Correct 4 ms 2688 KB Output is correct
13 Correct 75 ms 5004 KB Output is correct
14 Correct 81 ms 5088 KB Output is correct
15 Correct 72 ms 4984 KB Output is correct
16 Correct 81 ms 4984 KB Output is correct
17 Correct 77 ms 4932 KB Output is correct
18 Correct 74 ms 4984 KB Output is correct
19 Correct 73 ms 5752 KB Output is correct
20 Correct 88 ms 6008 KB Output is correct
21 Correct 68 ms 5752 KB Output is correct
22 Correct 74 ms 6008 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2716 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 4 ms 2816 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 4 ms 2688 KB Output is correct
12 Correct 4 ms 2688 KB Output is correct
13 Correct 75 ms 5004 KB Output is correct
14 Correct 81 ms 5088 KB Output is correct
15 Correct 72 ms 4984 KB Output is correct
16 Correct 81 ms 4984 KB Output is correct
17 Correct 77 ms 4932 KB Output is correct
18 Correct 74 ms 4984 KB Output is correct
19 Correct 73 ms 5752 KB Output is correct
20 Correct 88 ms 6008 KB Output is correct
21 Correct 68 ms 5752 KB Output is correct
22 Correct 74 ms 6008 KB Output is correct
23 Incorrect 4 ms 2688 KB Output isn't correct
24 Halted 0 ms 0 KB -