제출 #754354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
754354		lukameladze	최후의 만찬 (IOI12_supper)	C++17	100 / 100	239 ms	12760 KiB

advisor

# include "advisor.h"
# include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair <int, int>
#define pb push_back
const int MX = 3e5 + 5;
int n,k,m,c[MX],lst[MX], nxt[MX], j_del[MX];
set <int> cur;
set <pii> pot;
void ComputeAdvice(int *C, int N, int K, int M) {
    n = N; k = K; m = M;
    for (int i = 0; i < n + k; i++) {
        if (i < k) {
            c[i] = i;
        } else c[i] = C[i - k];
    }
    for (int i = 0; i < n; i++) {
        lst[i] = n + k + 1;
    }
    for (int i = n + k - 1; i >= 0; i--) {
        nxt[i] = lst[c[i]];
        lst[c[i]] = i;
    }
    for (int i = 0; i < n; i++) lst[i] = -1;
    for (int i = 0; i <= n + k - 1; i++) {
        if (cur.count(c[i])) {
            pot.erase({i, c[i]});
            pot.insert({nxt[i], c[i]});
        } else {
            if (cur.size() != k) {
                pot.insert({nxt[i], c[i]});
                cur.insert(c[i]);
            } else {
                auto it = --pot.end();
                int col = (*it).s;
                j_del[lst[col]] = 1; // imis washla nebismier dros shemidzlia
                pot.erase(it); cur.erase(col);
                pot.insert({nxt[i], c[i]}); cur.insert(c[i]);
            }
        }
        lst[c[i]] = i;
    }
    for (int i = 0; i < n + k; i++) {
        WriteAdvice(j_del[i]);
    }
}

assistant

#include "assistant.h"
# include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair <int, int>
#define pb push_back

void Assist(unsigned char *A, int N, int K, int R) {
    int n = N, k = K, r = R;
    vector <int> j_del, pre; pre = j_del = vector <int> (n + k, 0);
    set <int> cur, to_del;
    for (int i = 0; i < r; i++) {
        j_del[i] = A[i];
    }
    for (int i = 0; i < n; i++) pre[i] = -1;
    for (int i = 0; i < n + k; i++) {
        int to_add = (i < k ? i : GetRequest());
        if (cur.count(to_add) || cur.size() < k) {
            if (pre[to_add] != -1 && j_del[pre[to_add]]) to_del.erase(to_add);
            if (j_del[i]) to_del.insert(to_add);
            cur.insert(to_add);
        } else {
            auto it = to_del.begin(); int x = (*it);
            PutBack(x);
            to_del.erase(x); cur.erase(x); cur.insert(to_add);
            if (j_del[i]) to_del.insert(to_add);
        }
        pre[to_add] = i;
    }
}

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

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

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:19:45: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |         if (cur.count(to_add) || cur.size() < k) {
      |                                  ~~~~~~~~~~~^~~

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