oj.uz

답안 #415475

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
415475 2021-06-01T06:53:38 Z 조영욱(#7635) Shopping (JOI21_shopping) C++17
0 / 100
 4 ms 388 KB 
#include "Anna.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

namespace {

int N, L, R;
int l,r;
vector<int> v;
}  // namespace

void InitA(int N, int L, int R) {
  ::N = N;
  ::L = L;
  ::R = R;
    l=(L*512)/1000000;
    r=(R*512)/1000000;
    for(int i=0;i<9;i++) {
        SendA((l>>i)&1);
    }
    for(int i=0;i<9;i++) {
        SendA((r>>i)&1);
    }
}

void ReceiveA(bool x) {
    v.push_back(x);
}

int Answer() {
    if (L==R) {
        return L;
    }
    int ind=0;
    int ret=1048575;
    int pos=-1;
    bool flag=false;
    for(int i=0;i<N;i++) {
        int now=(i*512)/1000000;
        if (now==l) {
            if (i>=L&&i<=R) {
                int val=0;
                for(int j=0;j<20;j++) {
                    val+=(v[ind+j]<<j);
                }
                if (val<ret) {
                    ret=val;
                    pos=i;
                }
            }
            ind+=20;
        }
        else if (now==r) {
            if (!flag) {
                int ps=0;
                for(int j=0;j<20;j++) {
                    ps+=(v[ind+j]<<j);
                }
                ind+=20;
                int val=0;
                for(int j=0;j<20;j++) {
                    val+=(v[ind+j]<<j);
                }
                flag=true;
                if (val<ret) {
                    ret=val;
                    pos=ps;
                }
                ind+=20;
            }
            if (i<=R) {
                int val=0;
                for(int j=0;j<20;j++) {
                    val+=(v[ind+j]<<j);
                }
                if (val<ret) {
                    ret=val;
                    pos=i;
                }
            }
            ind+=20;
        }
    }
    return pos;
}

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

namespace {

int N;
int variable_example[1000000];
int cnt;
vector<int> vec;
int le,ri;
}  // namespace

void InitB(int N, vector<int> P) {
  ::N = N;
  vec=P;
  cnt=0;
}

void ReceiveB(bool y) {
    if (cnt<9) {
        le+=(y<<cnt);
    }
    else {
        ri+=(y<<(cnt-9));
    }
    cnt++;
    int mn=1048575;
    int pos=1048575;
    bool flag=false;
    if (cnt==18) {
        for(int i=0;i<N;i++) {
            int now=(i*512)/1000000;
            if (now==le) {
                for(int j=0;j<20;j++) {
                    SendB((vec[i]>>j)&1);
                }
            }
            else if (now>le&&now<ri) {
                if (vec[i]<mn) {
                    pos=i;
                    mn=vec[i];
                }
            }
            else if (now==ri) {
                if (!flag) {
                    for(int j=0;j<20;j++) {
                        SendB((pos>>j)&1);
                    }
                    for(int j=0;j<20;j++) {
                        SendB((mn>>j)&1);
                    }
                    flag=true;
                }
                for(int j=0;j<20;j++) {
                    SendB((vec[i]>>j)&1);
                }
            }
        }
    }
}

Compilation message

Bruno.cpp:9:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    9 | int variable_example[1000000];
      |     ^~~~~~~~~~~~~~~~

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 388 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Runtime error 1 ms 192 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 388 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Runtime error 1 ms 192 KB Execution killed with signal 13
7 Halted 0 ms 0 KB -

Subtask #3
0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 260 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -