oj.uz

답안 #1043979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043979 2024-08-05T05:35:41 Z 변재우(#11009) Prize (CEOI22_prize) C++17
0 / 100
 116 ms 4884 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() {
    scanf("%d %d %d %d", &N, &K, &Q, &T);
    for(int i=1; i<=N; i++) {
        int p; scanf("%d", &p);
        if(p<0) R1=i;
    }
    for(int i=1; i<=N; i++) {
        int p; scanf("%d", &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) printf("%d ", i);
    fflush(stdout);
    printf("\n");
    for(int i=0; i<K-1; i++) printf("? %d %d\n", V[i], V[i+1]);
    printf("!");
    fflush(stdout);
    printf("\n");
    for(int i=2; i<=K; i++)
        scanf("%d %d %d %d", 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; scanf("%d %d", &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) printf("0 0\n");
        else printf("%d %d\n", X[pb]-X[pa]+2*A[pa+1], Y[pa]-Y[pb]+2*D[pb]);
        fflush(stdout);
    }
    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;
      |                  ~^~~~~~~~~
Main.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d %d %d", &N, &K, &Q, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:13:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         int p; scanf("%d", &p);
      |                ~~~~~^~~~~~~~~~
Main.cpp:17:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         int p; scanf("%d", &p);
      |                ~~~~~^~~~~~~~~~
Main.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         scanf("%d %d %d %d", A+i, B+i, C+i, D+i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:42:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         int a, b; scanf("%d %d", &a, &b);
      |                   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 62 ms 4884 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 66 ms 2972 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 58 ms 4504 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 104 ms 4504 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 116 ms 4884 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -