이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "aliens.h"
ll n,m,k;
vll v;
ll dp[509][509];
ll bt(ll id,ll crnt){
if(id==v.size()){
if(k>crnt)return inf;
return 0;
}
ll &ret=dp[id][crnt];
if(ret!=-1)return ret;
ret=inf;
for(int i=id;i<v.size();i++){
ll sz=v[i]-v[id]+1;
ret=min(ret,bt(i+1,crnt+1)+sz*sz);
}
return ret;
}
ll take_photos(int N, int M, int K, vi r, vi c) {
mem(dp,-1);
n=N,k=K,m=M;
set<int>s;
for(int i=0;i<n;i++){
s.ins(r[i]);
}
for(auto u:s)v.pb(u);
return bt(0,0);
}
컴파일 시 표준 에러 (stderr) 메시지
aliens.cpp: In function 'll bt(ll, ll)':
aliens.cpp:34:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(id==v.size()){
~~^~~~~~~~~~
aliens.cpp:41:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=id;i<v.size();i++){
~^~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |