#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=(int)1e5;
int source[N+2],sink[N+2],l[N+2];
int n,k,q;
int add(int a,int b){
return (a+b>=n?a+b-n:a+b);
}
int sub(int a,int b){
return a-b<0?a-b+n:a-b;
}
namespace subtask1{
bool check(){
return n<=100 && q<=100;
}
const int LIMIT=100;
vector<int>ke[LIMIT+2][LIMIT+2];
void add_canh(int level,int u,int v){
ke[level][u].push_back(v);
}
int vis[LIMIT+2][LIMIT+2];
void process(int source,int sink){
queue<pair<int,int>>q;
memset(vis,false,sizeof vis);
for(int i=1;i<=l[source];++i) {
vis[i][source]=1;
q.push({i,source});
}
while (q.size()){
int level=q.front().first;
int u=q.front().second;
q.pop();
if (u==sink){
cout<<vis[level][u]-2<<'\n';
return;
}
for(auto&v:ke[level][u]){
for(int j=1;j<=l[v];++j){
if (vis[j][v]==0){
vis[j][v]=vis[level][u]+1;
q.push({j,v});
}
}
}
}
return;
}
void main_code(){
for(int level=1;level<=k;++level){
for(int i=0;i<n;++i){
for(int j=i-1;j>=0;--j){
if (l[j]>=level){
add_canh(level,i,j);
break;
}
}
for(int j=i+1;j<n;++j){
if (l[j]>=level){
add_canh(level,i,j);
break;
}
}
}
}
for(int i=1;i<=q;++i) process(source[i],sink[i]);
return;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0) ; cout.tie(0);
#define task "main"
if (fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin>>n>>k>>q;
for(int i=0;i<n;++i) cin>>l[i];
for(int i=1;i<=q;++i) {
cin>>source[i]>>sink[i];
--source[i] , --sink[i];
}
if (subtask1::check()){
return subtask1::main_code(),0;
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
railway_trip.cpp: In function 'int main()':
railway_trip.cpp:89:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
89 | freopen(task".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
railway_trip.cpp:90:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
90 | freopen(task".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# | 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... |