제출 #1247606

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247606		julia_08	Aliens (IOI16_aliens)	C++20	16 / 100	98 ms	4392 KiB

aliens

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

using ll = long long;

using namespace std;

const int MAXN = 1e3 + 10;

int dp[MAXN][MAXN], marc[MAXN];

int s[MAXN][MAXN];

int first_solve(int n, int m, int k, vector<int> r, vector<int> c){

  for(int i=1; i<=m; i++){
    for(int j=1; j<=m; j++){
      s[i][j] = 0;
    }
  }

  for(int i=0; i<n; i++){

    r[i] ++;
    c[i] ++;

    if(r[i] < c[i]) swap(r[i], c[i]);

    for(int j=c[i]; j<=r[i]; j++){
      for(int k=c[i]; k<=r[i]; k++){
        s[j][k] ++;
      }
    }

  } 

  int cnt = 0;

  for(int i=1; i<=m; i++){
    for(int j=1; j<=m; j++){
      if(s[i][j] > 0) cnt ++;
    }
  }

  return cnt;

}

ll take_photos(int n, int m, int k, vector<int> r, vector<int> c){

  if(k == n) return first_solve(n, m, k, r, c);

  for(int i=1; i<=m; i++) marc[i] = 0;

  for(int i=0; i<n; i++) marc[r[i] + 1] ++;

  for(int i=1; i<=m; i++){
    for(int l=0; l<=k; l++){

      dp[i][l] = 1e9;

      if(!marc[i]) dp[i][l] = dp[i - 1][l];

      if(l == 0) continue;

      for(int j=0; j<i; j++){
        dp[i][l] = min(dp[i][l], dp[j][l - 1] + (i - j) * (i - j));
      }

    }
  }

  return dp[m][k];

}

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

aliens.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
aliens_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40