제출 #286740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286740		Marlov	선물상자 (IOI15_boxes)	C++14	컴파일 에러	0 ms	0 KiB

boxes

/*
Code by @marlov       
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
#include "graders.h";
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;

#define maxN 10000000

int dpfront[maxN],dpback[maxN];

int delivery(int N,int K,int L,vector<int> pos){
	while(pos.front()==0){
		pos.erase(pos.begin());
		N--;
	}

	for(int i=0;i<N;i++){
		if(i<K) dpfront[i]=min(L,2*pos[i]);
		else dpfront[i]=min(L,2*pos[i])+dpfront[i-K];
	}
	for(int i=0;i<N;i++){
		if(i<K) dpback[i]=min(L,2*(L-pos[N-i-1]));
		else dpback[i]=min(L,2*(L-pos[N-i-1]))+dpback[N-i-1+K];
	}
	int result=min(dpback[N],dpfront[N]);
	for(int i=1;i<N-1;i++){
		result=max(dpfront[i]+dpback[N-i-1],result);
	}
	return result;
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

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

boxes.cpp:21:21: warning: extra tokens at end of #include directive
   21 | #include "graders.h";
      |                     ^
boxes.cpp:21:10: fatal error: graders.h: No such file or directory
   21 | #include "graders.h";
      |          ^~~~~~~~~~~
compilation terminated.