제출 #148139

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
148139	2019-08-31 14:13:37	WhipppedCream	Cup of Jamshid (IOI17_cup)	C++17	0 / 100	3 ms	376 KiB

cup

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 "cup.h"
#include <bits/stdc++.h>
using namespace std;
int ask(int a, int b)
{
  return ask_shahrasb(a, b);
}
const int maxn = 28;
vector<int> find_cup() {
    vector<int> result(2);
    int mulx, muly;
  mulx = muly = 1;
  int base = ask(0, 0);
  int check1 = ask((1<<29)-1, 0);
  int check2 = ask(0, (1<<29)-1);
    if(check1 & (1<<29)) mulx = -1;
  if(check2 & (1<<29)) muly = -1;
  int resx, resy;
  resx = resy = 0;
  //check for the case where x = 0
  //printf("*%d %d\n", mulx, muly);
  int temp = ask(-mulx*((1<<29)-1), 0);
  if((temp&(1<<29)) == 0)
  {
    //x = 0
    result[0] = 0;
    result[1] = muly*base;
    return result;
  }
  for(int i = maxn; i>= 0; i--)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 100