oj.uz

답안 #572904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572904 2022-06-05T13:13:39 Z AmirElarbi Art Collections (BOI22_art) C++17
0 / 100
 3000 ms 208 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e4+7;
const int nax = 5e3+7;
#include "art.h"
 
typedef complex<int> Point;
#define X real()
#define Y imag()
 
void solve(int N) {
    int n = N;
    int ans[N];
    vi order;
    for (int j = 1; j <= n; ++j)
    {
        ans[j] = -1;
        order.pb(j);
    }
    int init = publish(order);
    set<int> st;
    for (int i = 1; i < n; ++i)
    {
        order.clear();
        for (int j = 1; j <= n; ++j)
        {
            if(i!=j) order.pb(j);
        }
        order.pb(i);
        int ans2 = publish(order);
        int diff = init-ans2+n-1;
        int nb = distance(st.lower_bound(diff/2),st.begin());
        ans[diff/2+nb] = i;
        st.insert(diff/2);
    }
    vi res;
    for (int i = 0; i < n; ++i)
    {
        if(ans[i]==-1) ans[i] = n;
        res.pb(ans[i]);           
    }
    answer(res);
}

Compilation message

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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 3050 ms 208 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 3050 ms 208 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 3050 ms 208 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 3050 ms 208 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 3050 ms 208 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Execution timed out 3050 ms 208 KB Time limit exceeded
3 Halted 0 ms 0 KB -