제출 #61718

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
61718	2018-07-26 12:26:32	mAng0	Library (JOI18_library)	C++17	100 / 100	734 ms	704 KiB

library

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <cstdio>
#include <vector>
#include "library.h"
using namespace std;
vector<int> global_M;
vector<int> ban;
vector<int> ans;
int n, last;
int task_one(int s, int e){
    if(s == e) return s;
    int mid = (s + e) / 2;
    for(int i=0;i<n;i++) global_M[i] = 0;
    for(int i=s;i<=mid;i++){
        global_M[i] = 1;
    }
    int one = Query(global_M);
    for(int i=0;i<n;i++) global_M[i] = 1 - global_M[i];
    int two = Query(global_M);
    if(one >= two) return task_one(s, mid);
    else return task_one(mid+1, e);
}
int task_two(int s, int e){
    if(s == e) return s;
    int mid = (s + e) / 2;
    for(int i=0;i<n;i++) global_M[i] = 0;
    int cnt = 0;
    for(int i=s;i<=mid;i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 19 / 19
• Subtask 2: 81 / 81