oj.uz

답안 #744273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
744273 2023-05-18T10:16:54 Z MON 도서관 (JOI18_library) C++14
0 / 100
 371 ms 412 KB 
#include <cstdio>
#include <vector>
#include "library.h"
using namespace std;

void Solve(int N)
{
	vector<int> m(N,0); 
	vector<int> vecini[N]; int luat[N] = {0};
	for(int i = 0 ; i < N - 1 ; i++)
        {
            for(int j = i + 1 ; j < N ; j++)
                {
                    
                    fill(m.begin(),m.end(),0);
                    m[i] = m[j] = 1;

                    int sunt = Query(m); if(sunt != 1) sunt = 0;
                    if(sunt) 
                        {
                            vecini[i].emplace_back(j);
                            vecini[j].emplace_back(i);
                        }
                }
        }

    vector<int> ans;
    for(int i = 0; i < N ; i++)
        {
            if(vecini[i].size() == 1)
                {
                    ans.emplace_back(i);
                    luat[i] = 1; break;
                }
        }

    while(ans.size() < N)
        {
            for(auto &it : vecini[ans.back()])
                {
                    if(!luat[it])
                        {
                            luat[it] = 1;
                            ans.emplace_back(it);
                            break;
                        }
                }
        }

    for(auto &it : ans) it++;
    Answer(ans);
}

Compilation message

library.cpp: In function 'void Solve(int)':
library.cpp:37:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |     while(ans.size() < N)
      |           ~~~~~~~~~~~^~~

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 370 ms 280 KB # of queries: 18336
2 Correct 275 ms 296 KB # of queries: 18145
3 Correct 281 ms 288 KB # of queries: 19900
4 Correct 247 ms 288 KB # of queries: 19900
5 Correct 256 ms 284 KB # of queries: 19900
6 Correct 300 ms 288 KB # of queries: 19900
7 Correct 371 ms 288 KB # of queries: 19900
8 Correct 320 ms 284 KB # of queries: 18528
9 Correct 319 ms 288 KB # of queries: 19701
10 Correct 72 ms 412 KB # of queries: 8256
11 Runtime error 1 ms 336 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 370 ms 280 KB # of queries: 18336
2 Correct 275 ms 296 KB # of queries: 18145
3 Correct 281 ms 288 KB # of queries: 19900
4 Correct 247 ms 288 KB # of queries: 19900
5 Correct 256 ms 284 KB # of queries: 19900
6 Correct 300 ms 288 KB # of queries: 19900
7 Correct 371 ms 288 KB # of queries: 19900
8 Correct 320 ms 284 KB # of queries: 18528
9 Correct 319 ms 288 KB # of queries: 19701
10 Correct 72 ms 412 KB # of queries: 8256
11 Runtime error 1 ms 336 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -