제출 #1124233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1124233		modwwe	오렌지 출하 (JOI16_ho_t1)	C++20	100 / 100	29 ms	584 KiB

2016_ho_t1

#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e18;
const ll mod2 = 1e9+7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    double a;
    int b;
};
struct ic
{
    ll a;
    int  b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
//   checktime
}
int dp[20001];
int a[20001];
void phongbeo()
{
    cin>>n>>m>>k;
    dp[0]=0;
    for(int i=1; i<=n; i++)
        cin>>a[i];
        for(int i=1;i<=n;i++)
             dp[i]=inf;
    for(int i=1; i<=n; i++)
    {
        int maxx=-inf;
        int minn=inf;
        for(int j=i; j<=min(i+m-1,n); j++)
        {
            maxx=max(maxx,a[j]);
            minn=min(minn,a[j]);
            dp[j]=min(dp[j],dp[i-1]+(j-i+1)*(maxx-minn)+k);
        }
    }
    cout<<dp[n];
}

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

2016_ho_t1.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main()
      | ^~~~
2016_ho_t1.cpp: In function 'int main()':
2016_ho_t1.cpp:12:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
2016_ho_t1.cpp:79:9: note: in expansion of macro 'fin'
   79 |         fin(task);
      |         ^~~
2016_ho_t1.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
2016_ho_t1.cpp:80:9: note: in expansion of macro 'fou'
   80 |         fou(task);
      |         ^~~

• Subtask 1: 20 / 20
• Subtask 2: 50 / 50
• Subtask 3: 30 / 30