oj.uz

Submission #112614

# Submission time Handle Problem Language Result Execution time Memory
112614 2019-05-20T20:59:32 Z BorisBarca Tenis (COI19_tenis) C++14
51 / 100
 500 ms 11716 KB 
/*
	$$$$$$$\                      $$\           $$$$$$$\
	$$  __$$\                     \__|          $$  __$$\
	$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
	$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
	$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
	$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
	$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
	\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>

using namespace std;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define si pair<string, int>
#define is pair<int, string>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FORP(i, a, b) for ((i) = (a); (i) < (b); ++i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define MSET memset
#define MCPY memcpy
#define SQ(a) (a) * (a)

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<si> vsi;
typedef vector<is> vis;
typedef vector<string> vs;
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int LOG = 19;
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
  if (a + b >= MOD)
  	return a + b - MOD;
  if (a + b < 0)
  	return a + b + MOD;
  return a + b;
}

inline void add(int &a, int b){
  a = sum(a, b);
}

inline int mul(int a, int b){
  return (ll)a * (ll)b % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int pot(ll pot, int n){
	ll ret = 1;
	while (n){
		if (n & 1)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline double ccw(pii A, pii B, pii C){
	return (A.X * B.Y) - (A.Y * B.X) + (B.X * C.Y) - (B.Y * C.X) + (C.X * A.Y) - (C.Y * A.X);
}

inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 1e5 + 10;

vi e[N], p[3];
bool bio[N], win[N];

void dfs(int node){
	if (bio[node])
		return;
	bio[node]++;
	win[node]++;
	FORA(nxt, e[node])
		dfs(nxt);
}

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int n, q; cin >> n >> q;
	REP(i, 3){
		REP(j, n){
			int x; cin >> x;
			p[i].PB(x);
		}
	}

	REP(i, 3)
		FORD(j, n - 1, 0)
			e[p[i][j]].PB(p[i][j - 1]);

	//win[p[0][0]] = win[p[1][0]] = win[p[2][0]] = 1;
	dfs(p[0][0]);
	dfs(p[1][0]);
	dfs(p[2][0]);

	REP(i, q){
		int c, x; cin >> c >> x;
		if (c == 1)
			cout << (win[x] ? "DA" : "NE") << '\n';
		else {
			int a, b; cin >> a >> b;
			int ra, rb;
			REP(j, n){
				if (p[x - 1][j] == a)
					ra = j;
				if (p[x - 1][j] == b)
					rb = j;
			}
			swap(p[x - 1][ra], p[x - 1][rb]);
			REP(i, N)
				e[i].clear();
			REP(i, 3)
				FORD(j, n - 1, 0)
					e[p[i][j]].PB(p[i][j - 1]);
			memset(win, 0, sizeof win);
			memset(bio, 0, sizeof bio);
			dfs(p[0][0]);
			dfs(p[1][0]);
			dfs(p[2][0]);
		}
	}

	return 0;
}

Compilation message

tenis.cpp: In function 'void dfs(int)':
tenis.cpp:156:11: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
  bio[node]++;
           ^~
tenis.cpp:157:11: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
  win[node]++;
           ^~
tenis.cpp: In function 'int main()':
tenis.cpp:197:34: warning: 'rb' may be used uninitialized in this function [-Wmaybe-uninitialized]
    swap(p[x - 1][ra], p[x - 1][rb]);
                                  ^
tenis.cpp:197:20: warning: 'ra' may be used uninitialized in this function [-Wmaybe-uninitialized]
    swap(p[x - 1][ra], p[x - 1][rb]);
                    ^

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 5 ms 2944 KB Output is correct
4 Correct 4 ms 2944 KB Output is correct
5 Correct 4 ms 2944 KB Output is correct
6 Correct 4 ms 2944 KB Output is correct
7 Correct 6 ms 2944 KB Output is correct
8 Correct 5 ms 2944 KB Output is correct
9 Correct 5 ms 2944 KB Output is correct
10 Correct 6 ms 2916 KB Output is correct
11 Correct 5 ms 2944 KB Output is correct
12 Correct 5 ms 2944 KB Output is correct
13 Correct 153 ms 10216 KB Output is correct
14 Correct 193 ms 10736 KB Output is correct
15 Correct 90 ms 9144 KB Output is correct
16 Correct 87 ms 9324 KB Output is correct
17 Correct 60 ms 8948 KB Output is correct
18 Correct 74 ms 8936 KB Output is correct
19 Correct 65 ms 8820 KB Output is correct
20 Correct 135 ms 9304 KB Output is correct
21 Correct 66 ms 8940 KB Output is correct
22 Correct 81 ms 9076 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 8476 KB Output is correct
2 Correct 78 ms 7644 KB Output is correct
3 Correct 75 ms 7544 KB Output is correct
4 Correct 81 ms 7400 KB Output is correct
5 Correct 80 ms 7540 KB Output is correct
6 Correct 78 ms 7412 KB Output is correct
7 Correct 97 ms 7476 KB Output is correct
8 Correct 77 ms 7400 KB Output is correct
9 Correct 75 ms 7660 KB Output is correct
10 Correct 72 ms 7412 KB Output is correct
11 Correct 89 ms 7888 KB Output is correct
12 Correct 73 ms 7412 KB Output is correct
13 Correct 86 ms 7376 KB Output is correct
14 Correct 82 ms 7552 KB Output is correct
15 Correct 83 ms 7540 KB Output is correct

Subtask #5
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 5 ms 2944 KB Output is correct
4 Correct 4 ms 2944 KB Output is correct
5 Correct 4 ms 2944 KB Output is correct
6 Correct 4 ms 2944 KB Output is correct
7 Correct 6 ms 2944 KB Output is correct
8 Correct 5 ms 2944 KB Output is correct
9 Correct 5 ms 2944 KB Output is correct
10 Correct 6 ms 2916 KB Output is correct
11 Correct 5 ms 2944 KB Output is correct
12 Correct 5 ms 2944 KB Output is correct
13 Correct 153 ms 10216 KB Output is correct
14 Correct 193 ms 10736 KB Output is correct
15 Correct 90 ms 9144 KB Output is correct
16 Correct 87 ms 9324 KB Output is correct
17 Correct 60 ms 8948 KB Output is correct
18 Correct 74 ms 8936 KB Output is correct
19 Correct 65 ms 8820 KB Output is correct
20 Correct 135 ms 9304 KB Output is correct
21 Correct 66 ms 8940 KB Output is correct
22 Correct 81 ms 9076 KB Output is correct
23 Correct 81 ms 8476 KB Output is correct
24 Correct 78 ms 7644 KB Output is correct
25 Correct 75 ms 7544 KB Output is correct
26 Correct 81 ms 7400 KB Output is correct
27 Correct 80 ms 7540 KB Output is correct
28 Correct 78 ms 7412 KB Output is correct
29 Correct 97 ms 7476 KB Output is correct
30 Correct 77 ms 7400 KB Output is correct
31 Correct 75 ms 7660 KB Output is correct
32 Correct 72 ms 7412 KB Output is correct
33 Correct 89 ms 7888 KB Output is correct
34 Correct 73 ms 7412 KB Output is correct
35 Correct 86 ms 7376 KB Output is correct
36 Correct 82 ms 7552 KB Output is correct
37 Correct 83 ms 7540 KB Output is correct
38 Execution timed out 1081 ms 11716 KB Time limit exceeded
39 Halted 0 ms 0 KB -