# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1174702 | mmmmge1234 | Cultivation (JOI17_cultivation) | C++20 | 1137 ms | 4796 KiB |
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
const long long INF = 4e18;
pair<long long, long long> P[303];
long long a[303], S[707], E[707], X[3][707], dp[303][303], F[2][303][303], L, U;
int dq[3][707], n;
pair<long long, int> V[303];
int f[303], g[303];
long long solve(long long len){
int sz = 0;
for(int i = 1, j = 1; i <= n || j <= n;){
long long s = min(a[i], a[j] + len);
while(a[i] == s || a[j] + len == s){
if(a[i] == s) i++;
if(a[j] + len == s) j++;
}
if(j > n) break;
long long e = min(a[i], a[j] + len);
assert(j < i);
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |