oj.uz

답안 #931908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931908 2024-02-22T14:26:23 Z Younis_Dwai Art Collections (BOI22_art) C++17
20 / 100
 81 ms 704 KB 
#include "art.h"
#include <bits/stdc++.h>
using namespace std ;
#define pb push_back
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
//     art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
void solve(int N) {
    if(N<3){
        vector<int> vv;
        for(int i=1;i<=N;i++) vv.pb(i);
        do{
            int res=publish(vv);
            if(res==0){
                    answer(vv);
                    break;
            }
        }while(next_permutation(vv.begin(),vv.end()));
        return ;
    }
    else  {
    vector<int> v;
    for(int i=1;i<=N;i++) v.pb(i);
    random_shuffle(v.begin(),v.end());
    vector<int> done;
    done.pb(v[0]);
    for(int i=1;i<N;i++){
        vector<int> guess;
        guess.pb(done[0]);
        guess.pb(v[i]);
        for(int j=1;j<=N;j++){
            if(j!=done[0] && j!=v[i]) guess.pb(j);
        }
        int res1=publish(guess);
        swap(guess[0],guess[1]);
        int res2=publish(guess);
        if(res2<=res1){
            vector<int> cur=done;
            done.clear();
            done.pb(v[i]);
            for(auto u : cur) done.pb(u);
        }
        else{
            guess.clear();
            guess.pb(v[i]);
            guess.pb(done[i-1]);
            for(int j=1;j<=N;j++){
                if(j==done[i-1] || j==v[i]) continue ;
                guess.pb(j);
            }
            res1=publish(guess);
            swap(guess[0],guess[1]);
            res2=publish(guess);
            if(res2<res1){
               done.pb(v[i]);
            }
            else{
                int l=0,r=i-1,mid=(l+r)/2;
                while(l<r){
                    guess.clear();
                    guess.pb(v[i]);
                    guess.pb(done[mid]);
                    for(int j=1;j<=N;j++){
                        if(j==done[mid] || j==v[i]) continue ;
                        guess.pb(j);
                    }
                    res1=publish(guess);
                    swap(guess[0],guess[1]);
                    res2=publish(guess);
                    if(res2>res1) r=mid;
                    else l=mid+1;
                    mid=(l+r)/2;
                }
                vector<int> cur;
                cur.clear();
                for(int j=0;j<done.size();j++){
                     if(j==mid){
                        cur.pb(v[i]);
                     }
                     cur.pb(done[j]);
                }
                done=cur;
            }
        }
    }
    answer(done);
    }
    return ;
}

Compilation message

art.cpp: In function 'void solve(int)':
art.cpp:85:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |                 for(int j=0;j<done.size();j++){
      |                             ~^~~~~~~~~~~~
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 4 ms 432 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 4 ms 432 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 3 ms 600 KB Output is correct
26 Incorrect 81 ms 704 KB Not correct
27 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 4 ms 432 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 3 ms 600 KB Output is correct
26 Incorrect 81 ms 704 KB Not correct
27 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 4 ms 432 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 3 ms 600 KB Output is correct
26 Incorrect 81 ms 704 KB Not correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 4 ms 432 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 3 ms 600 KB Output is correct
26 Incorrect 81 ms 704 KB Not correct
27 Halted 0 ms 0 KB -