oj.uz

답안 #804203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
804203 2023-08-03T07:32:44 Z vjudge1 도서관 (JOI18_library) C++14
0 / 100
 1 ms 464 KB 
#include<bits/stdc++.h>
#include"library.h"
using namespace std ;
const int N = 1000 ;
bool us[N + 1] = {} ;
bool abu[N + 1][N + 1] = {} ;
//int Query(vector<int>& v)
//{
//    int num ;
//    cout << "? " ;
//    for(int i : v)
//        cout << i << ' ' ;
//    cout << '\n' ;
//    cin >> num ;
//    return num ;
//}
//void Answer(vector<int>&res)
//{
//    cout << "! " ;
//    for(int i : res)
//        cout << i << ' ' ;
//    exit(0) ;
//}
void Solve(int n)
{
    vector<int> ans ;
    deque<int> d ;
    if(n <= 200)
    {
        us[1] = 1 ;
        for(int i = 1 ; i <= n ; i++)
            abu[i][i] = 1 ;
        d.push_back(1) ;
        while(d.size() != n)
        {
            for(int i = 1 ; i <= n ; i++)
            {
                if(us[i] || abu[d.back()][i])
                    continue ;
                abu[d.back()][i] = 1 ;
                vector<int> v ;
                v.push_back(d.back()) ;
                v.push_back(i) ;
                if(Query(v) == 1)
                {
                    us[i] = 1 ;
                    d.push_back(i) ;
                    break ;
                }
            }
            for(int i = 1 ; i <= n ; i++)
            {
                if(us[i] || abu[d[0]][i])
                    continue ;
                abu[d[0]][i] = 1 ;
                vector<int> v ;
                v.push_back(d[0]) ;
                v.push_back(i) ;
                if(Query(v) == 1)
                {
                    us[i] = 1 ;
                    d.push_front(i) ;
                    break ;
                }
            }
        }
        for(int i : d)
            ans.push_back(i) ;
        Answer(ans) ;
    }
}
//signed main()
//{
//    int n ;
//    cin >> n ;
//    Solve(n) ;
//    return 0 ;
//}

Compilation message

library.cpp: In function 'void Solve(int)':
library.cpp:34:24: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |         while(d.size() != n)
      |               ~~~~~~~~~^~~~

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 464 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 464 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -