제출 #1240708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1240708		madamadam3	Mosaic (IOI24_mosaic)	C++20	7 / 100	75 ms	12872 KiB

mosaic

#include "mosaic.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
using vi =vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pi = pair<int, int>;
using vpi = vector<pi>;

#ifdef LOCAL
  #define dout std::cout
#else
  #define dout if (0) std::cout
#endif

#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define en(x) (x).end()
#define bg(x) (x).begin()
#define rev(x) reverse(all(x))
#define sz(x) int((x).size())
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define each(a, x) for (auto &a : x)
#define trace(x) for (auto &el : x) dout << el << " "

vl mosaic(vi X, vi Y, vi T, vi B, vi L, vi R) {
  int Q = sz(T), n = sz(X);
  vl C(Q, 0);

  // vvi grid(n, vi(n, 0));
  // FOR(i, 0, n) {
  //   grid[0][i] = X[i];
  //   grid[i][0] = Y[i];
  // }

  // FOR(i, 1, n) {
  //   FOR(j, 1, n) {
  //     if (grid[i-1][j] == 0 && grid[i][j-1] == 0) grid[i][j] = 1;
  //     else grid[i][j] = 0;
  //   }
  // }

  vl prefx(n+1, 0); FOR(i, 0, n) prefx[i+1] = prefx[i] + X[i];
  FOR(qn, 0, Q) {
    int x1 = T[qn], x2 = B[qn], y1 = L[qn], y2 = R[qn];
    C[qn] = prefx[y2+1] - prefx[y1];
    // FOR(x, x1, x2+1) {
    //   FOR(y, y1, y2+1) {
    //     C[qn] += grid[x][y];
    //   }
    // } 
  }

  return C;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 7 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22