oj.uz

Submission #414606

# Submission time Handle Problem Language Result Execution time Memory
414606 2021-05-30T18:00:17 Z ollel Vision Program (IOI19_vision) C++14
0 / 100
 10 ms 1076 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;
// }
//
// bool add_and(vi& q) {
//   cout << "and:\n";
//   for(auto &i : q) cout << i << " ";cout<<endl;
//   bool ans; cin >> ans;
//   return ans;
// }


void kone()
{
  vi R;
  rep(i, 0, h) {
    vi indices;
    rep(j, 0, w) indices.pb(j + i*w);
    R.pb(add_or(indices));
  }

  vi C;
  rep(j, 0, w) {
    vi indices;
    rep(i, 0, h) indices.pb(j + i*w);
    C.pb(add_or(indices));
  }

  vi adjc;
  rep(i, 0, w - 1) {
    vi ask = {C[i], C[i + 1]};
    adjc.pb(add_and(ask));
  }
  vi adjr;
  rep(i, 0, h - 1) {
    vi ask = {R[i], R[i + 1]};
    adjr.pb(add_and(ask));
  }

  vi pos;
  vi ask = {add_xor(R), add_or(adjc)};
  pos.pb(add_and(ask));
  ask.clear();
  ask = {add_xor(C), add_or(adjr)};
  pos.pb(add_and(ask));

  add_or(pos);
}

void construct_network(int H, int W, int K)
{
  h = H; w = W; k = K; inst = h * w;
  if (k == 1) {kone(); return;}

  int fi = inst;
  rep(x, 0, w) rep(y, 0, h) {
    vi ask = {x+y*w};
    rep(x2, 0, w) rep(y2, 0, h) {
      if (abs(x2 - x) + abs(y2 - y) == k) {
        vi ask = {x+y*w, x2+y2*w};
        inst = add_and(ask);
      }
    }
  }

  vi ask;
  rep(i,fi,inst+1) ask.pb(i);
  add_or(ask);
}

// 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 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 292 KB WA in grader: Instruction with no inputs
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 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Incorrect 4 ms 1056 KB WA in grader: Too many instructions
5 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1076 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Incorrect 1 ms 332 KB WA in grader: Instruction with no inputs
6 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -