oj.uz

답안 #603186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
603186 2022-07-23T16:41:12 Z Ahmadsm2005 Event Hopping (BOI22_events) C++17
0 / 100
 1500 ms 199244 KB 
#include <bits/stdc++.h>
//#define int long long
using namespace std;
int N,Q,S[5001],E[5001],X,Y;
vector<int>ADJ[5001];
bool VIS[5001];
int DIST[5001][5001];
void BFS(int x,int DIS = 0){
for(int i = 0;i < N; i += 1)VIS[i] = 0;
queue<pair<int,int>>Q;
Q.push({x,0});
while(Q.size()){
    int V = Q.front().first, S = Q.front().second;
    Q.pop();
    if(VIS[V])continue;
    VIS[V] = 1;
    DIST[x][V] = S;
    for(int i = 0; i <ADJ[V].size(); i += 1)Q.push({ADJ[V][i], S + 1});
}
}
int32_t main()
{
    cin.tie(0),iostream::sync_with_stdio(0);
    cin>>N>>Q;
    for(int i = 0; i < N; i += 1)for(int l = 0; l < N; l += 1)DIST[i][l] = -1;
    for(int i = 0; i < N; i += 1){
        cin>>S[i]>>E[i];
    }
    for(int i = 0; i < N; i += 1){
        for(int l = 0; l < N; l += 1){
            if(S[l] <= E[i]&&E[i]<=E[l])
                ADJ[i].push_back(l);
        }
    }
    for(int i = 0; i < N; i += 1)BFS(i);
    while(Q--){
        cin>>X>>Y;
        (DIST[X - 1][Y - 1] == -1?cout<<"impossible\n":cout<<DIST[X - 1][Y - 1]<<'\n');
    }
}

Compilation message

events.cpp: In function 'void BFS(int, int)':
events.cpp:18:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i = 0; i <ADJ[V].size(); i += 1)Q.push({ADJ[V][i], S + 1});
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Runtime error 165 ms 199244 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 25 ms 8408 KB Output is correct
4 Correct 20 ms 8432 KB Output is correct
5 Correct 33 ms 8432 KB Output is correct
6 Correct 483 ms 9488 KB Output is correct
7 Execution timed out 1579 ms 12772 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 25 ms 8408 KB Output is correct
4 Correct 20 ms 8432 KB Output is correct
5 Correct 33 ms 8432 KB Output is correct
6 Correct 483 ms 9488 KB Output is correct
7 Execution timed out 1579 ms 12772 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 25 ms 8408 KB Output is correct
4 Correct 20 ms 8432 KB Output is correct
5 Correct 33 ms 8432 KB Output is correct
6 Correct 483 ms 9488 KB Output is correct
7 Execution timed out 1579 ms 12772 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 194 ms 199236 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Runtime error 165 ms 199244 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -