QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #116845 | #149. Peru | csy2005# | Compile Error | / | / | C++14 | 1.7kb | 2023-06-30 09:14:34 | 2024-05-31 18:31:48 |
Judging History
你现在查看的是测评时间为 2024-05-31 18:31:48 的历史记录
- [2024-05-31 18:31:48]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-06-30 09:14:34]
- 提交
answer
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#include<cassert>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);(i)>=1;(i)--)
#define fz0g(i,n) for ((i)=0;(i)<=(n);(i)++)
#define fd0g(i,n) for ((i)=(n);(i)>=0;(i)--)
#define fz0k(i,n) for ((i)=0;(i)<(n);(i)++)
#define fd0k(i,n) for ((i)=(((long long)(n))-1);(i)>=0;(i)--)
#define fz(i,x,y) for ((i)=(x);(i)<=(y);(i)++)
#define fd(i,y,x) for ((i)=(y);(i)>=(x);(i)--)
#define fzin fz1(i,n)
#define fzim fz1(i,m)
#define fzjn fz1(j,n)
#define fzjm fz1(j,m)
#define ff(c,itr) for (__typeof((c).begin()) itr=(c).begin();itr!=(c).end();++itr)
#define pb push_back
#define mk make_pair
#define rdst(st,len){static char ss[len];scanf(" %s",ss);(st)=ss;}
#define spln(i,n) (i==n?'\n':' ')
#define fac_init(n){fac[0]=fac[1]=inv[1]=fi[0]=fi[1]=1;fz(i,2,n){fac[i]=1ll*fac[i-1]*i%mod;inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;fi[i]=1ll*fi[i-1]*inv[i]%mod;}}
using namespace std;
typedef long long i64;
typedef long double f80;
typedef unsigned int u32;
typedef unsigned long long u64;
//typedef __int128 i128;
//typedef unsigned __int128 u128;
const int mod=1e9+7;
int n,k,i,j,a[2500005];
i64 f[2500005];
int solve(int nn,int kk,int *aa)
{
n=nn;k=kk;fz1(i,n)a[i]=aa[i-1];
fz1(i,n){
f[i]=0x3f3f3f3f3f3f3f3fll;int cur=a[i];
fd(j,i-1,max(0,i-k)) f[i]=min(f[i],cur+f[j]),cur=max(cur,a[j]);
}
// fz1(i,n)cerr<<f[i]<<' ';cerr<<endl;
int ans=0;fz1(i,n)ans=(23ll*ans+f[i])%mod;return ans;
}
Details
implementer.cpp: In function ‘int main()’:
implementer.cpp:34:13: error: ‘fout’ was not declared in this scope; did you mean ‘out’?
34 | fprintf(fout, "%d\n", sol);
| ^~~~
| out
implementer.cpp: In function ‘char nextch()’:
implementer.cpp:15:31: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
15 | if (pos == BUF_SIZE) fread(buf, BUF_SIZE, 1, fin), pos = 0;
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~