제출 #702542

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702542		Ronin13	최후의 만찬 (IOI12_supper)	C++14	0 / 100	76 ms	6276 KiB

advisor

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define epb emplace_back
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#include "advisor.h"
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
    int n = N, k = K;
  int last[N];
  fill(last, last + N, n + 1);
  set <int> st;
  vector <int> vec;
  for(int i = N - 1; i >= 0; i--){
        int x = last[C[i]];
        st.erase(x);
        st.insert(i);
        last[C[i]] = i;
        if(st.size() > k)
            vec.pb(1), st.erase(*st.rbegin());
        else vec.pb(0);
  }
  for(int i = k - 1; i >= 0; i--){
    if(st.find(last[i]) == st.end()){
        vec.pb(1);
    }
    else vec.pb(0);
  }

  for(int i = vec.size() - 1; i >= 0; i--)
    WriteAdvice(vec[i]);
}

assistant

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define epb emplace_back
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>

#include "assistant.h"
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {

    int n = N, k = K;
    queue <int> q;
    vector <bool> used(n, false);
    for(int i = 0; i < k; i++){
        if(A[i] == 1)
            q.push(i);
        used[i] = true;
    }

    int val = k;
    for(int i = k; i < n + k; i++){
        int x = GetRequest();
        if(!used[x])val++;
        if(val > k){
            int v = q.front();
            PutBack(v);
            used[v] = false;
            q.pop();
            val--;
        }
        used[x] = true;
        if(A[i] == 1)
            q.push(x);
    }
}

컴파일 시 표준 에러 (stderr) 메시지

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:23:22: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |         if(st.size() > k)
      |            ~~~~~~~~~~^~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 35
• Subtask 5: 0 / 39