oj.uz

답안 #923535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923535 2024-02-07T11:46:23 Z alexander707070 카멜레온의 사랑 (JOI20_chameleon) C++14
0 / 100
 14 ms 344 KB 
#include <bits/stdc++.h>
#include "chameleon.h"
#define MAXN 1007

using namespace std;

namespace {

int n;
vector<int> to[MAXN];
vector< pair<int,int> > sol;

}  // namespace

void Solve(int N) {
    n=N;
    for(int i=1;i<=2*n;i++){
        for(int f=i+1;f<=2*n;f++){
            if(Query({i,f})==1){
                to[i].push_back(f);
                to[f].push_back(i);
            }
        }
    }

    for(int i=1;i<=2*n;i++){
        int br=0;
        if(to[i].empty() or to[i].size()>3)cout<<1/0;
        for(int f=0;f<to[i].size();f++){
            for(int k:to[to[i][f]]){
                if(k==i)br++;
                if(k==i and i<to[i][f])sol.push_back({i,to[i][f]});
            }
        }
     //   if(br>1)cout<<1/0;
    }
    
    for(int i=0;i<sol.size();i++){
        Answer(sol[i].first,sol[i].second);
    }
}

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:28:51: warning: division by zero [-Wdiv-by-zero]
   28 |         if(to[i].empty() or to[i].size()>3)cout<<1/0;
      |                                                  ~^~
chameleon.cpp:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int f=0;f<to[i].size();f++){
      |                     ~^~~~~~~~~~~~~
chameleon.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i=0;i<sol.size();i++){
      |                 ~^~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 14 ms 344 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 14 ms 344 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -