# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1137938 | SmuggingSpun | Synchronization (JOI13_synchronization) | C++20 | 49 ms | 17988 KiB |
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
const int lim = 1e5 + 5;
const int INF = 1e9;
int n, m, q;
pair<int, int>edge[lim];
vector<int>g[lim];
namespace sub1{
int ans = 0;
bitset<lim>state;
map<pair<int, int>, vector<int>>G_edge;
void dfs(int s, int p = -1, int t = INF){
ans++;
for(int& d : g[s]){
if(d != p){
pair<int, int>cur = make_pair(min(s, d), max(s, d));
auto it = lower_bound(G_edge[cur].begin(), G_edge[cur].end(), t);
if(it != G_edge[cur].begin()){
dfs(d, s, *prev(it));
}
}
}
}
void solve(){
state.reset();
for(int t = 0; t < m; t++){
int x;
cin >> x;
if(state.test(x)){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |