| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 872774 |
2023-11-13T18:03:35 Z |
Danet |
Klasika (COCI20_klasika) |
C++14 |
|
5000 ms |
4304 KB |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define tof_io ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double long double
#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define endl '\n'
const int mod = 998244353; //998244353 1e9+7 1e9+9
const int inf = 1e18;
const int N = 2e4 + 23;
const int lg = 23;
int fac[N];
int inv[N];
int dnt_pow (int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
void dnt_bld (){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
int dnt_ncr (int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
bool cmp (pair<int,int> a, pair<int,int> b){ return a.second > b.second; }
vector<pair<int, int>> adj[N];
int vis[N];
int now;
int ans = 0;
void dfs1(int v, int pr, bool flag)
{
if(v == now)
flag = true;
if(flag)
{
vis[v] = 1;
}
for(auto u : adj[v])
{
if(u.first != pr)
{
dfs1(u.first, v, flag);
}
}
}
void dfs(int v, int pr, int h)
{
if(vis[v])
ans = max(ans, h);
for(auto u : adj[v])
{
if(u.first != pr)
{
dfs(u.first, v, h ^ u.second);
}
}
}
int32_t main()
{
int q;
cin >> q;
string x;
int a, b, sz = 1;
while(q --)
{
cin >> x >> a >> b;
if(x == "Add")
{
adj[a-1].pb(make_pair(sz, b));
adj[sz].pb(make_pair(a - 1, b));
sz++;
}
else
{
now = b - 1;
for(int i = 0; i < sz; i++)
{
vis[i] = 0;
}
dfs1(0, -1, false);
ans = 0;
dfs(a - 1, -1, 0);
cout << ans << endl;
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
856 KB |
Output is correct |
| 2 |
Correct |
1 ms |
856 KB |
Output is correct |
| 3 |
Correct |
1 ms |
916 KB |
Output is correct |
| 4 |
Correct |
1 ms |
860 KB |
Output is correct |
| 5 |
Correct |
1 ms |
916 KB |
Output is correct |
| 6 |
Correct |
1 ms |
856 KB |
Output is correct |
| 7 |
Correct |
1 ms |
672 KB |
Output is correct |
| 8 |
Correct |
1 ms |
912 KB |
Output is correct |
| 9 |
Correct |
1 ms |
860 KB |
Output is correct |
| 10 |
Correct |
1 ms |
860 KB |
Output is correct |
| 11 |
Correct |
1 ms |
860 KB |
Output is correct |
| 12 |
Correct |
1 ms |
860 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
856 KB |
Output is correct |
| 2 |
Correct |
1 ms |
856 KB |
Output is correct |
| 3 |
Correct |
1 ms |
916 KB |
Output is correct |
| 4 |
Correct |
1 ms |
860 KB |
Output is correct |
| 5 |
Correct |
1 ms |
916 KB |
Output is correct |
| 6 |
Correct |
1 ms |
856 KB |
Output is correct |
| 7 |
Correct |
1 ms |
672 KB |
Output is correct |
| 8 |
Correct |
1 ms |
912 KB |
Output is correct |
| 9 |
Correct |
1 ms |
860 KB |
Output is correct |
| 10 |
Correct |
1 ms |
860 KB |
Output is correct |
| 11 |
Correct |
1 ms |
860 KB |
Output is correct |
| 12 |
Correct |
1 ms |
860 KB |
Output is correct |
| 13 |
Correct |
7 ms |
860 KB |
Output is correct |
| 14 |
Correct |
8 ms |
860 KB |
Output is correct |
| 15 |
Correct |
8 ms |
1020 KB |
Output is correct |
| 16 |
Correct |
6 ms |
860 KB |
Output is correct |
| 17 |
Correct |
8 ms |
860 KB |
Output is correct |
| 18 |
Correct |
9 ms |
860 KB |
Output is correct |
| 19 |
Correct |
9 ms |
860 KB |
Output is correct |
| 20 |
Correct |
7 ms |
860 KB |
Output is correct |
| 21 |
Correct |
8 ms |
960 KB |
Output is correct |
| 22 |
Correct |
10 ms |
856 KB |
Output is correct |
| 23 |
Correct |
10 ms |
860 KB |
Output is correct |
| 24 |
Correct |
7 ms |
860 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
5048 ms |
4304 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
856 KB |
Output is correct |
| 2 |
Correct |
1 ms |
856 KB |
Output is correct |
| 3 |
Correct |
1 ms |
916 KB |
Output is correct |
| 4 |
Correct |
1 ms |
860 KB |
Output is correct |
| 5 |
Correct |
1 ms |
916 KB |
Output is correct |
| 6 |
Correct |
1 ms |
856 KB |
Output is correct |
| 7 |
Correct |
1 ms |
672 KB |
Output is correct |
| 8 |
Correct |
1 ms |
912 KB |
Output is correct |
| 9 |
Correct |
1 ms |
860 KB |
Output is correct |
| 10 |
Correct |
1 ms |
860 KB |
Output is correct |
| 11 |
Correct |
1 ms |
860 KB |
Output is correct |
| 12 |
Correct |
1 ms |
860 KB |
Output is correct |
| 13 |
Correct |
7 ms |
860 KB |
Output is correct |
| 14 |
Correct |
8 ms |
860 KB |
Output is correct |
| 15 |
Correct |
8 ms |
1020 KB |
Output is correct |
| 16 |
Correct |
6 ms |
860 KB |
Output is correct |
| 17 |
Correct |
8 ms |
860 KB |
Output is correct |
| 18 |
Correct |
9 ms |
860 KB |
Output is correct |
| 19 |
Correct |
9 ms |
860 KB |
Output is correct |
| 20 |
Correct |
7 ms |
860 KB |
Output is correct |
| 21 |
Correct |
8 ms |
960 KB |
Output is correct |
| 22 |
Correct |
10 ms |
856 KB |
Output is correct |
| 23 |
Correct |
10 ms |
860 KB |
Output is correct |
| 24 |
Correct |
7 ms |
860 KB |
Output is correct |
| 25 |
Execution timed out |
5048 ms |
4304 KB |
Time limit exceeded |
| 26 |
Halted |
0 ms |
0 KB |
- |
