# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745849 | vjudge1 | Event Hopping (BOI22_events) | C++17 | 1568 ms | 524288 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;
#define int long long
vector<vector<int>> tav;
vector<vector<int>> g;
main() {
int N, Q; cin>>N>>Q;
vector<int> s(N), e(N);
for(int i=0; i<N; ++i)
{
cin>>s[i]>>e[i];
}
g.resize(N);
tav.assign(N, vector<int>(N, INT_MAX/2));
for(int i=0; i<N; ++i)
{
for(int j=0; j<N; ++j)
{
if(i!=j && s[j]<=e[i] && e[i]<=e[j]) g[i].push_back(j);
}
}
for(int i=0; i<N; ++i)
{
tav[i][i]=0;
vector<int> volt(N, false);
queue<int> q;
q.push(i);
while(!q.empty())
{
int a=q.front();
q.pop();
volt[a]=true;
for(int to:g[a])
{
if(volt[to]) continue;
volt[to]=true;
q.push(to);
tav[i][to]=tav[i][a]+1;
}
}
}
for(int i=0; i<Q; ++i)
{
int a, b; cin>>a>>b; a--; b--;
if(tav[a][b]==INT_MAX/2)
{
cout<<"impossible\n";
continue;
}
cout<<tav[a][b]<<'\n';
}
for(auto x:tav)
{
for(auto y:x) cerr<<y<<' ';
cerr<<endl;
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |