oj.uz

Submission #714386

# Submission time Handle Problem Language Result Execution time Memory
714386 2023-03-24T10:02:29 Z vjudge1 Art Collections (BOI22_art) C++17
0 / 100
 1 ms 208 KB 
#include "art.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define size(v) v.size()
#define all(v) v.begin(), v.end()
#define f first
#define s second

using namespace std;
//
// --- 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) {
    std::vector<int> R(N);
    for(int i = 0; i < N; ++i){
        R[i] = i + 1;
    }

    for(int i = 0; i < N; i++){
        std::vector<int> temp(N);
        temp = R;
        int val = R[i], curr = i;
        int low = 0, high = N - 1, best = publish(R);
        while(low <= high){
            int mid = (low + high) >> 1;
            swap(temp[mid], temp[curr]);
            int cnt = publish(temp);
            if(cnt > publish(R)){
                swap(temp[mid], temp[curr]);
                if(curr < mid){
                    high = mid - 1;
                }else{
                    low = mid + 1;
                }
            }else{
                best = cnt;
                if(curr < mid){
                    low = mid + 1;
                    curr = mid;
                }else{
                    high = mid - 1;
                    curr = mid;
                }
            }
            R = temp;
        }
    }
    if(!publish(R)) answer(R);
    else{
        for(int i = 0; i < N - 1; i++){
            swap(R[i], R[i + 1]);
            if(!publish(R)){
                answer(R);
            }else{
                swap(R[i], R[i + 1]);
            }
        }
    }

}

Compilation message

art.cpp: In function 'void solve(int)':
art.cpp:32:13: warning: unused variable 'val' [-Wunused-variable]
   32 |         int val = R[i], curr = i;
      |             ^~~
art.cpp:33:36: warning: variable 'best' set but not used [-Wunused-but-set-variable]
   33 |         int low = 0, high = N - 1, best = publish(R);
      |                                    ^~~~
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
0 / 5.0

# Verdict Execution time Memory 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 Incorrect 1 ms 208 KB Security violation!
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory 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 Incorrect 1 ms 208 KB Security violation!
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory 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 Incorrect 1 ms 208 KB Security violation!
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory 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 Incorrect 1 ms 208 KB Security violation!
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory 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 Incorrect 1 ms 208 KB Security violation!
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory 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 Incorrect 1 ms 208 KB Security violation!
5 Halted 0 ms 0 KB -