oj.uz

답안 #118593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118593 2019-06-19T09:31:31 Z Plurm 최후의 만찬 (IOI12_supper) C++11
0 / 100
 482 ms 34632 KB 
#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;

int FT[100005];
void add(int idx, int amt){
    idx++;
    while(idx < 100005){
        FT[idx] += amt;
        idx += idx & -idx;
    }
}
int sum(int idx){
    idx++;
    int ret = 0;
    while(idx > 0){
        ret += FT[idx];
        idx -= idx & -idx;
    }
    return ret;
}
int nxt[100005];
set<int> s[100005];
void ComputeAdvice(int *C, int N, int K, int M) {
    // Compute everything in the morning.
    // Remember only ordering of the removals.
    for(int i = 0; i < N; i++){
        s[C[i]].insert(i);
    }
    for(int i = 0; i < N; i++){
        set<int>::iterator it = s[C[i]].upper_bound(i);
        if(it == s[C[i]].end()){
            nxt[i] = N;
        }else{
            nxt[i] = *it;
        }
    }
    priority_queue<pair<int,int> > pq;
    set<int> use;
    vector<int> raw;
    for(int i = 0; i < K; i++){
        use.insert(i);
        add(i,1);
        if(s[i].empty())
            pq.push(make_pair(N, i));
        else
            pq.push(make_pair(*s[i].begin(), i));
    }
    for(int i = 0; i < N; i++){
        if(use.find(C[i]) != use.end()){
            raw.push_back(K);
        }else{
            pair<int,int> cur = pq.top();
            pq.pop();
            raw.push_back(sum(cur.second));
            use.erase(cur.second);
            add(cur.second, -1);
            use.insert(C[i]);
            add(C[i], 1);
            pq.push(make_pair(nxt[i], C[i]));
        }
    }
    for(int i = 0; i < raw.size(); i++){
        for(int j = 0; j < 15; j++){
            if(raw[i] & (1 << j)){
                WriteAdvice(1);
            }else{
                WriteAdvice(0);
            }
        }
    }
}

#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;

int FTS[100005];
void addS(int idx, int amt){
    idx++;
    while(idx < 100005){
        FTS[idx] += amt;
        idx += idx & -idx;
    }
}
int sumS(int idx){
    idx++;
    int ret = 0;
    while(idx > 0){
        ret += FTS[idx];
        idx -= idx & -idx;
    }
    return ret;
}
int getidx(int num){
    int lo = 0;
    int hi = 100003;
    int mid;
    while(lo < hi){
        mid = (lo + hi)/2;
        if(sumS(mid) < num){
            lo = mid+1;
        }else{
            hi = mid;
        }
    }
    return lo;
}
void Assist(unsigned char *A, int N, int K, int R) {
    vector<int> dat;
    for(int i = 0; i < R; i += 15){
        int cur = 0;
        for(int j = 0; j < 15; j++){
            if(A[i+j]){
                cur += 1 << j;
            }
        }
        dat.push_back(cur);
    }
    set<int> use;
    for(int i = 0; i < K; i++){
        use.insert(i);
        addS(i,1);
    }
    for(int i = 0; i < N; i++){
        int cur = GetRequest();
        if(use.find(cur) != use.end()) continue;
        int now = dat[i];
        int eidx = getidx(now);
        PutBack(eidx);
        use.erase(eidx);
        addS(eidx, -1);
        use.insert(cur);
        addS(cur, 1);
    }
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:63:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < raw.size(); i++){
                    ~~^~~~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 10240 KB Output is correct
2 Incorrect 10 ms 9984 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 46 ms 12784 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 365 ms 29456 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 10752 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 459 ms 33864 KB Output isn't correct - not an optimal way
2 Incorrect 453 ms 34168 KB Output isn't correct - not an optimal way
3 Incorrect 475 ms 34624 KB Output isn't correct - not an optimal way
4 Incorrect 464 ms 34320 KB Output isn't correct - not an optimal way
5 Incorrect 462 ms 34408 KB Output isn't correct - not an optimal way
6 Incorrect 465 ms 34624 KB Output isn't correct - not an optimal way
7 Incorrect 471 ms 34368 KB Output isn't correct - not an optimal way
8 Incorrect 482 ms 34624 KB Output isn't correct - not an optimal way
9 Incorrect 442 ms 34368 KB Output isn't correct - not an optimal way
10 Partially correct 426 ms 34632 KB Output is partially correct - 1500000 bits used