제출 #370402

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
370402		fhvirus	"The Lyuboyn" code (IZhO19_lyuboyn)	C++17	3 / 100	1 ms	512 KiB

lyuboyn

// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) (x).begin(),(x).end()
template<typename I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr << endl;}
template<typename I, typename...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<typename I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a)==b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif

int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	puts("-1");
	return 0;
}

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

lyuboyn.cpp:10: warning: "FOR" redefined
   10 | #define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
      | 
lyuboyn.cpp:9: note: this is the location of the previous definition
    9 | #define FOR(i,n) for(int i = 0; i < (n); ++i)
      |

• Subtask 1: 0 / 0
• Subtask 2: 0 / 5
• Subtask 3: 3 / 3
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 31
• Subtask 8: 0 / 17