oj.uz

답안 #464057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464057 2021-08-12T10:19:28 Z AmShZ Inside information (BOI21_servers) C++11
0 / 100
 83 ms 24680 KB 
//khodaya khodet komak kon
# include <bits/stdc++.h>

using namespace std;

typedef long long                                        ll;
typedef long double                                      ld;
typedef pair <int, int>                                  pii;
typedef pair <pii, int>                                  ppi;
typedef pair <int, pii>                                  pip;
typedef pair <pii, pii>                                  ppp;
typedef pair <ll, ll>                                    pll;

# define A                                               first
# define B                                               second
# define endl                                            '\n'
# define sep                                             ' '
# define all(x)                                          x.begin(), x.end()
# define kill(x)                                         return cout << x << endl, 0
# define SZ(x)                                           int(x.size())
# define lc                                              id << 1
# define rc                                              id << 1 | 1
# define fast_io                                         ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}

const int xn = 3e5 + 10;
const int xm = - 20 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const ld eps = 1e-15;
const int mod = 1e9 + 7;//998244353;
const int base = 257;

int n, k, a[xn], ans;
vector <pii> adj[xn];
vector <int> vec;
bool fl[xn];

void DFS(int v, int p = - 1){
	if (p == - 1)
		fl[v] = true, a[v] = 0;
	else
		fl[v] = (fl[p] && a[p] < a[v]);
	vec.push_back(v);
	for (pii u : adj[v])
		if (u.A != p)
			a[u.A] = u.B, DFS(u.A, v);
}

int main(){
	fast_io;

	cin >> n >> k;
	for (int i = 1; i < n + k; ++ i){
		char c;
		int x, v, u;
		cin >> c;
		if (c == 'S'){
			cin >> v >> u;
			adj[v].push_back({u, i});
			adj[u].push_back({v, i});
		}
		else if (c == 'Q'){
			cin >> u >> v;
			DFS(v);
			if (fl[u] && a[u] <= i)
				cout << "yes" << endl;
			else
				cout << "no" << endl;
		}
		else{
			cin >> v;
			vec.clear();
			DFS(v);
			ans = 0;
			for (int u : vec)
				ans += (fl[u] && a[u] <= i);
			cout << ans << endl;
		}
	}

	return 0;
}

Compilation message

servers.cpp: In function 'int main()':
servers.cpp:58:7: warning: unused variable 'x' [-Wunused-variable]
   58 |   int x, v, u;
      |       ^

Subtask #1
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 16440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 16440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 83 ms 24680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 83 ms 24680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 16504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 16504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 16556 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 16556 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 58 ms 16428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 58 ms 16428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 63 ms 16276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 63 ms 16276 KB Output isn't correct
2 Halted 0 ms 0 KB -