Submission #734807

# Submission time Handle Problem Language Result Execution time Memory
734807 2023-05-03T06:08:11 Z keisuke6 Circle selection (APIO18_circle_selection) C++17
0 / 100
448 ms 1048576 KB
#include <bits/stdc++.h>
using namespace std;

int main(){
  int N,K,Q;
  cin>>N>>K>>Q;
  vector<int> X(N),T(N),A(N),B(N);
  for(int i=0;i<N;i++){
    cin>>X[i]>>T[i]>>A[i]>>B[i];
    T[i]--;
  }
  while(Q--){
    int x,t;
    cin>>x>>t;
    vector<int> S(K,2e9);
    for(int i=0;i<N;i++){
      if(A[i] > t || B[i] < t) continue;
      S[T[i]] = min(S[T[i]],abs(X[i]-x));
    }
    sort(S.rbegin(),S.rend());
    cout<<(S[0] == 2e9 ? -1 : S[0])<<endl;
  }
}
# Verdict Execution time Memory Grader output
1 Runtime error 448 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 323 ms 4984 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 430 ms 660208 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 369 ms 9988 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 448 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 448 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -