제출 #1305122

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305122		kawhiet	모자이크 (IOI24_mosaic)	C++20	컴파일 에러	0 ms	0 KiB

mosaic

#include <bits/stdc++.h>
#include "mosaic.h"
using namespace std;

bool first = 1;
vector<vector<int>> a;
vector<vector<long long>> p;

long long get(int x1, int y1, int x2, int y2) {
  x1++; y1++; x2++; y2++;
  return p[x2][y2] - p[x2][y1 - 1] - p[x1 - 1][y2] + p[x1 - 1][y1 - 1];
}
  
vector<long long> mosaic(vector<int> x, vector<int> y, vector<int> t, vector<int> b, vector<int> l, vector<int> r) {
  int n = x.size(), q = t.size();
  if (first) {
    a.assign(n, vector<int>(n, -1));
    p.assign(n + 1, vector<long long>(n + 1, 0));
    a[0] = x;
    for (int i = 1; i < n; i++) {
      a[i][0] = y[i];
    }
    for (int i = 1; i < n; i++) {
      for (int j = 1; j < n; j++) {
        if ((a[i - 1][j] | a[i][j - 1]) == 0) {
          a[i][j] = 1;
        } else {
          a[i][j] = 0;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        p[i + 1][j + 1] = p[i + 1][j] + p[i][j + 1] - p[i][j] + a[i][j];
      }
    }
    first = 0;
  }
  vector<long long> ret;
  for (int i = 0; i < q; i++) {
    ret.push_back(get(t[i], l[i], b[i], r[i]));
  }
  return ret;
}

int main() {
  int N;
  assert(1 == scanf("%d", &N));
  vector<int> X(N), Y(N);
  for (int i = 0; i < N; i++)
    assert(1 == scanf("%d", &X[i]));
  for (int i = 0; i < N; i++)
    assert(1 == scanf("%d", &Y[i]));
  int Q;
  assert(1 == scanf("%d", &Q));
  vector<int> T(Q), B(Q), L(Q), R(Q);
  for (int k = 0; k < Q; k++)
    assert(4 == scanf("%d%d%d%d", &T[k], &B[k], &L[k], &R[k]));
  fclose(stdin);

  vector<long long> C = mosaic(X, Y, T, B, L, R);
  int S = (int)C.size();
  for (int k = 0; k < S; k++)
    printf("%lld\n", C[k]);
  fclose(stdout);

  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

/usr/bin/ld: /tmp/cczyRCSB.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccxIq81f.o:mosaic.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status