oj.uz

답안 #736309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736309 2023-05-05T12:27:37 Z ksu2009en Art Collections (BOI22_art) C++17
20 / 100
 108 ms 300 KB 
#include "art.h"
//
// --- 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
//
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef int ll;

ll publish0(vector<ll>a){
    vector<ll>ans;
    for(int i = 1; i < a.size(); i++)
        ans.push_back(a[i]);
    
    return publish(ans);
}

void solve(int n) {
    vector<ll>a = {0};
    for(int i = 1; i <= n; i++)
        a.push_back(i);
    
    ll x = publish0(a);
    if(x == 0){
        vector<ll>ans;
        for(int i = 1; i < a.size(); i++)
            ans.push_back(a[i]);
        
        answer(ans);
    }
    
    set<ll>st;
    
    for(int i = n; i >= 1; i--){
        for(int pos = 1; pos <= i; pos++){
            vector<ll>b = {0};
            
            for(int j = 1; j <= i; j++)
                if(j != pos)
                    b.push_back(a[j]);
            
            b.push_back(a[pos]);
            for(int j = i + 1; j <= n; j++)
                b.push_back(a[j]);
            
            //for(auto j: b)
           //     cout << j << ' ';
            //cout << endl;
            
            ll y = publish0(b);
            //cout << x << ' ' << y << endl;
            if(x - y == i - pos){
          //      cout << "OK" << endl;
                x = y;
                a = b;
                break;
            }
        }
    //   cout << "_______" << endl;
    }
    
    vector<ll>ans;
    for(int i = 1; i < a.size(); i++)
        ans.push_back(a[i]);
    
    answer(ans);
}

Compilation message

art.cpp: In function 'll publish0(std::vector<int>)':
art.cpp:37:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i = 1; i < a.size(); i++)
      |                    ~~^~~~~~~~~~
art.cpp: In function 'void solve(int)':
art.cpp:51:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         for(int i = 1; i < a.size(); i++)
      |                        ~~^~~~~~~~~~
art.cpp:88:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for(int i = 1; i < a.size(); i++)
      |                    ~~^~~~~~~~~~
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 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 7 ms 300 KB Output is correct
12 Correct 11 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 9 ms 208 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 8 ms 220 KB Output is correct
25 Correct 7 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 8 ms 208 KB Output is correct
28 Incorrect 108 ms 208 KB Not correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 7 ms 300 KB Output is correct
12 Correct 11 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 9 ms 208 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 8 ms 220 KB Output is correct
25 Correct 7 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 8 ms 208 KB Output is correct
28 Incorrect 108 ms 208 KB Not correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 7 ms 300 KB Output is correct
12 Correct 11 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 9 ms 208 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 8 ms 220 KB Output is correct
25 Correct 7 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 8 ms 208 KB Output is correct
28 Incorrect 108 ms 208 KB Not correct
29 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 7 ms 300 KB Output is correct
12 Correct 11 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 9 ms 208 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 8 ms 220 KB Output is correct
25 Correct 7 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 8 ms 208 KB Output is correct
28 Incorrect 108 ms 208 KB Not correct
29 Halted 0 ms 0 KB -