oj.uz

Submission #1043987

# Submission time Handle Problem Language Result Execution time Memory
1043987 2024-08-05T05:50:32 Z 변재우(#11009) Prize (CEOI22_prize) C++17
0 / 100
 407 ms 14556 KB 
#include <bits/stdc++.h>
using namespace std;

const int Nmax=1000010;
int N, K, Q, T, R1, R2, A[Nmax], B[Nmax], C[Nmax], D[Nmax], I[Nmax];
int X[Nmax], Y[Nmax];
vector<int> V;
vector<pair<int, int>> P;

int main() {
    cin>>N>>K>>Q>>T;
    for(int i=1; i<=N; i++) {
        int p; cin>>p;
        if(p<0) R1=i;
    }
    for(int i=1; i<=N; i++) {
        int p; cin>>p;
        if(p<0) R2=i;
    }
    if(R1==R2) {
        V.push_back(R1);
        for(int i=1; i<=N && V.size()<K; i++) if(i!=R1) V.push_back(i);
    }
    else {
        V.push_back(R1);
        for(int i=1; i<=N && V.size()<K-1; i++) if(i!=R1 && i!=R2) V.push_back(i);
        V.push_back(R2);
    }
    for(int i=0; i<V.size(); i++) I[V[i]]=i+1;
    for(int i:V) cout<<i<<" ";
    cout<<"\n";
    cout.flush();
    for(int i=0; i<K-1; i++) cout<<"? "<<V[i]<<" "<<V[i+1]<<"\n";
    cout<<"!\n";
    cout.flush();
    for(int i=2; i<=K; i++) cin>>A[i]>>B[i]>>C[i]>>D[i];
    for(int i=2; i<=K; i++) X[i]=X[i-1]-A[i]+B[i];
    for(int i=K-1; i>=1; i--) Y[i]=Y[i+1]-D[i+1]+C[i+1];
    for(int i=1; i<=T; i++) {
        int a, b; cin>>a>>b;
        P.push_back({a, b});
    }
    for(auto [a, b]:P) {
        int pa=I[a], pb=I[b];
        if(pa>pb) swap(pa, pb);
        if(pa==pb) cout<<"0 0\n";
        else cout<<X[pb]-X[pa]+2*A[pa+1]<<" "<<Y[pa]-Y[pb]+2*D[pb]<<"\n";
    }
    cout.flush();
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:22:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |         for(int i=1; i<=N && V.size()<K; i++) if(i!=R1) V.push_back(i);
      |                              ~~~~~~~~^~
Main.cpp:26:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |         for(int i=1; i<=N && V.size()<K-1; i++) if(i!=R1 && i!=R2) V.push_back(i);
      |                              ~~~~~~~~^~~~
Main.cpp:29:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i=0; i<V.size(); i++) I[V[i]]=i+1;
      |                  ~^~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 292 ms 14556 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 240 ms 12832 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 147 ms 13336 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 306 ms 13836 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 407 ms 12840 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -