# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701329 | angelo_torres | Event Hopping (BOI22_events) | C++17 | 1562 ms | 40952 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 10;
int n,q,s[N],e[N],d[N][N];
bool o[N];
vector<int> g[N];
void bfs(int v){
for(int i = 1; i <= n; ++i) d[v][i] = N, o[i] = 0;
d[v][v] = 0;
queue<int> q;
q.push(v);
while(!q.empty()){
int r = q.front();
q.pop();
for(auto u : g[r]){
if(!o[u]){
o[u] = 1, d[v][u] = d[v][r]+1;
q.push(u);
}
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> q;
for(int i = 1; i <= n; ++i) cin >> s[i] >> e[i];
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |