oj.uz

Submission #414471

# Submission time Handle Problem Language Result Execution time Memory
414471 2021-05-30T13:04:57 Z ollel Vision Program (IOI19_vision) C++14
0 / 100
 6 ms 716 KB 
#include <bits/stdc++.h>
#include <iostream>
#include "vision.h"
using namespace std;

#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int h, w, k, inst;

// bool add_or(vi& q) {
//   cout << "or:\n";
//   for(auto &i : q) cout << i << " ";cout<<endl;
//   bool ans; cin >> ans;
//   return ans;
// }
//
// bool add_not(int x ) {
//   cout << "not:\n";
//   cout << x << endl;
//   bool ans; cin >> ans; return ans;
// }

int search()
{
    int low = 0, high = w*h, mid;
    while (high - low > 1) {
      mid = (high + low) / 2;
      vi ask(mid - low);
      rep(i,low,mid) ask[i-low] = i;
      inst++;
      if (add_or(ask)) high = mid;
      else low = mid;
    }
    if (!add_not(low)) {
      vi ask(1000002);
      rep(i,0,1000002) ask[i] = i;
      add_or(ask);
    }
    return low;
}

void findk(int I)
{
  int x = I % w, y = I / w;
  // cout << "coords: " << x << ", "<<y<<endl;

  int first_inst = inst + 1;
  rep(dif, -k, k + 1) {
    int X = x + dif;
    if (X < 0 || X >= w) continue;

    int ydif = k - abs(dif);
    int Y = y + ydif;
    if (Y >= 0 && Y < h) {
      vi ask = {Y * w + X};
      // cout << "coords: " << X << ", "<<Y<<endl;
      add_or(ask);
      inst++;
    }
    Y = y - ydif;
    if (Y >= 0 && Y < h) {
      vi ask = {Y * w + X};
      // cout << "coords: " << X << ", "<<Y<<endl;
      add_or(ask);
      inst++;
    }
  }
  // cout << first_inst << " , "<<inst << endl;
  if (first_inst <= inst){
    vi ask;
    rep(i,first_inst, inst+1) ask.pb(i);
    add_or(ask);
  } else add_not(I);
}

void construct_network(int H, int W, int K)
{
  h = H; w = W; k = K;
  inst = w * h - 1;
  int x = search();
  // cout << "X: " << x << endl;
  findk(x);
}

// int main() {
//   int H ,W, K; cin >> H>>W>>K;construct_network(H, W, K);
// }

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 3), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 0), (1, 1), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 716 KB on inputs (126, 120), (176, 169), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -