제출 #224547

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
224547	2020-04-18 11:35:25	maximath_1	Feast (NOI19_feast)	C++17	100 / 100	195 ms	13944 KiB

feast

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gc getchar
#define pc putchar
int in(){
  char c=gc(); bool neg=false;
  for(; c<'0'||'9'<c; c=gc())
    if(c=='-') neg=true;
  int rs=c-'0'; c=gc();
  for(; '0'<=c && c<='9'; c=gc())
    rs=(rs<<1)+(rs<<3)+(c-'0');
  if(neg) rs=-rs;
  return rs;
}
void out(ll _n){
  ll N=_n, rev, count=0;
  rev=N;
  if(N==0) {pc('0'); return;}
  while((rev%10ll)==0) {count++; rev/=10;}
  rev=0;
  while(N!=0) {rev=(rev<<3ll)+(rev<<1ll)+N%10; N/=10;}
  while(rev!=0) {pc(rev%10ll+'0'); rev/=10;}
  while(count--) pc('0');
}
int n, k, val[300005];
pair<ll, int> dp[300005][2];
pair<ll, int> solve(ll x){
  for(int i=1; i<=n; i++){
    if(dp[i-1][0].first>dp[i-1][1].first-x)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 8 / 8
• Subtask 3: 18 / 18
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 20 / 20
• Subtask 7: 29 / 29