oj.uz

Submission #424868

# Submission time Handle Problem Language Result Execution time Memory
424868 2021-06-12T11:00:44 Z madlogic Vision Program (IOI19_vision) C++17
0 / 100
 4 ms 1480 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

// int cur;

// int add_xor(vector<int> v) {
//   cout << "XOR" << endl;
//   for (int p : v) {
//     cout << p << ' ';
//   }
//   cout << '\n';
//   return ++cur;
// }

// int add_or(vector<int> v) {
//   cout << "OR" << endl;
//   for (int p : v) {
//     cout << p << " ";
//   }
//   cout << '\n';
//   return ++cur;
// }

// int add_and(vector<int> v) {
//   cout << "AND" << endl;
//   for (int p : v) {
//     cout << p << ' ';
//   }
//   cout << '\n';
//   return ++cur;
// }

void construct_network(int H, int W, int K) {
  // cur = (H - 1) * W + (W - 1);
  vector<vector<vector<int>>> dp(3, vector<vector<int>>(H, vector<int>(W, -1)));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      vector<int> v{i * W + j};
      for (int x = 0; x <= K; x++) {
        int y = K - x;
        set<int> s;
        s.insert(y);
        s.insert(-y);
        for (int ys : s) {
          int dx = i + x;
          int dy = j + ys;
          if (dx >= 0 && dx < H && dy >= 0 && dy < W) {
            int yy = dx * W + dy;
            v.push_back(yy);
          }
        }
      }
      dp[0][i][j] = add_xor(v);
      dp[1][i][j] = add_or(v);
      reverse(v.begin(), v.end());
      v.pop_back();
      if (!v.empty()) {
        dp[2][i][j] = add_xor(v);
      } 
    }
  }
  vector<int> v;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      int a = dp[0][i][j];
      int b = dp[1][i][j];
      if (dp[2][i][i] != -1) {
        int id1 = add_xor({a, b});
        int idx = add_and({id1, dp[2][i][j]});
        v.push_back(idx);
      }
    }
  }
  add_or(v);
}

// int main() {
//   ios::sync_with_stdio(false);
//   cin.tie(0);
//   construct_network(3, 3, 2);
//   return 0;
// }

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 WA in grader: Invalid index
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 WA in grader: Invalid index
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 WA in grader: Invalid index
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 WA in grader: Invalid index
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 4 ms 332 KB Output is correct
3 Incorrect 3 ms 332 KB WA in grader: Invalid index
4 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 Incorrect 2 ms 1096 KB WA in grader: Too many instructions
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1480 KB WA in grader: Too many instructions
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 WA in grader: Invalid index
3 Halted 0 ms 0 KB -