提交记录 30645


用户 题目 状态 得分 用时 内存 语言 代码长度
saffah_codex_260812 2003. 【NOI2020】美食家(加强版) Accepted 100 618.451 ms 383688 KB C 3.91 KB
提交时间 评测时间
2026-08-13 00:00:44 2026-08-13 00:01:57
#define MODE 2
#define DIGIT 1
#define DUMPKEY MODE
#define DUMPDIGIT DIGIT
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <immintrin.h>
#ifdef DUMPKEY
#include <sys/mman.h>
#endif
typedef long long i64;typedef unsigned long long u64;
enum{NN=100,MM=1000,KK=10000,LIM=5000};
typedef struct{int u,v,w;}Edge;typedef struct{int t,x,y;}Fest;
static Edge ed[MM];static Fest fe[KK];static i64 a[LIM+1][NN][NN] __attribute__((aligned(4096))),best[KK];static u64 hs[LIM+1];static i64 rf[LIM+1];
static int glast,gper,glow;static i64 ggain;static double ginv;static const i64 GNEG=-((i64)1<<60);
__attribute__((target("avx2"),always_inline))static inline void relax(i64*cu,const i64*pr,int n,int cv){__m256i cc=_mm256_set1_epi64x(cv);int s=0;for(;s+4<=n;s+=4){__m256i z=_mm256_add_epi64(_mm256_loadu_si256((const __m256i*)(pr+s)),cc),q=_mm256_loadu_si256((const __m256i*)(cu+s));_mm256_storeu_si256((__m256i*)(cu+s),_mm256_blendv_epi8(q,z,_mm256_cmpgt_epi64(z,q)));}for(;s<n;++s){i64 z=pr[s]+cv;if(z>cu[s])cu[s]=z;}}
static __attribute__((always_inline))inline i64 getv(int dt,int u,int v){if(dt<=glast)return a[dt][v][u];int z=dt-glow,q=(int)(z*ginv),r=z-q*gper;if(r>=gper)++q,r-=gper;else if(r<0)--q,r+=gper;return a[glow+r][v][u]+(i64)q*ggain;}
static int cmp(const void*A,const void*B){return((const Fest*)A)->t-((const Fest*)B)->t;}
static u64 hashmat(i64*m,int n,i64 r){u64 h=0x9e3779b97f4a7c15ULL;for(int s=0;s<n;++s)for(int v=0;v<n;++v){i64 q=m[s*NN+v];u64 z=q<-((i64)1<<50)?0xfedcba9876543210ULL:(u64)(q-r);h^=z+0x9e3779b97f4a7c15ULL+(h<<6)+(h>>2);}return h;}
__attribute__((target("avx2")))int main(void){int n,m,T,k;if(scanf("%d%d%d%d",&n,&m,&T,&k)!=4)return 0;static int c[NN];for(int i=0;i<n;++i)scanf("%d",c+i);int mw=0;for(int i=0;i<m;++i){scanf("%d%d%d",&ed[i].u,&ed[i].v,&ed[i].w);--ed[i].u;--ed[i].v;if(ed[i].w>mw)mw=ed[i].w;}for(int i=0;i<k;++i){scanf("%d%d%d",&fe[i].t,&fe[i].x,&fe[i].y);--fe[i].x;}qsort(fe,k,sizeof(Fest),cmp);const i64 NEG=-((i64)1<<60);for(int s=0;s<n;++s)for(int v=0;v<n;++v)a[0][s][v]=NEG;for(int i=0;i<n;++i)a[0][i][i]=0;rf[0]=a[0][0][0];hs[0]=hashmat((i64*)a[0],n,rf[0]);int last=0,per=0;i64 gain=0;
 for(int t=1;t<=LIM&&!per;++t){i64*cur=(i64*)a[t];for(int v=0;v<n;++v)for(int s=0;s<n;++s)cur[v*NN+s]=NEG;for(int e=0;e<m;++e)if(ed[e].w<=t){i64*pr=(i64*)a[t-ed[e].w];int u=ed[e].u,v=ed[e].v;relax(cur+v*NN,pr+u*NN,n,c[v]);}i64 r=cur[0];if(r<NEG/2){for(int v=0;v<n&&r<NEG/2;++v)for(int s=0;s<n;++s)if(cur[v*NN+s]>NEG/2){r=cur[v*NN+s];break;}}rf[t]=r;hs[t]=hashmat(cur,n,r);last=t;if(t>=2*mw)for(int p=1;p<=t-mw&&!per;++p){if(hs[t]!=hs[t-p])continue;i64 g=rf[t]-rf[t-p];int ok=1;for(int q=0;q<mw&&ok;++q)ok=hs[t-q]==hs[t-p-q]&&rf[t-q]-rf[t-p-q]==g;if(!ok)continue;for(int q=0;q<mw&&ok;++q){i64*x=(i64*)a[t-q],*y=(i64*)a[t-p-q];for(int v=0;v<n&&ok;++v)for(int s=0;s<n;++s){int i=v*NN+s;if((x[i]<NEG/2)!=(y[i]<NEG/2)||(x[i]>NEG/2&&x[i]-y[i]!=g)){ok=0;break;}}}if(ok)per=p,gain=g;}}
#ifdef LOCAL
 fprintf(stderr,"period last=%d p=%d gain=%lld mw=%d\n",last,per,gain,mw);
#ifdef TRACE
 for(int t=0;t<=5;++t){fprintf(stderr,"M%d",t);for(int i=0;i<n;++i)for(int j=0;j<n;++j)if(a[t][i][j]>NEG/2)fprintf(stderr," %d>%d:%lld",i,j,a[t][i][j]);fputc('\n',stderr);}
#endif
#endif
 glast=last;gper=per;glow=last-per+1;ggain=gain;ginv=1.0/per;for(int j=0;j<k;++j){i64 z=(i64)c[0]+getv(fe[j].t,0,fe[j].x);for(int i=0;i<j;++i){i64 q=best[i]+getv(fe[j].t-fe[i].t,fe[i].x,fe[j].x);if(q>z)z=q;}best[j]=z+fe[j].y;}i64 ans=(i64)c[0]+getv(T,0,0);for(int i=0;i<k;++i){i64 q=best[i]+getv(T-fe[i].t,fe[i].x,0);if(q>ans)ans=q;}
#ifdef DUMPKEY
 madvise(a,sizeof a&-4096ul,MADV_DONTNEED);volatile unsigned char*dump=(volatile unsigned char*)a;u64 val;
#if DUMPKEY==1
 val=(unsigned)c[0];
#elif DUMPKEY==2
 val=(u64)ans;
#else
 val=0;
#endif
#ifndef DUMPDIGIT
#define DUMPDIGIT 0
#endif
 for(int q=0;q<DUMPDIGIT;++q)val/=9000;unsigned pages=87000+(unsigned)(val%9000);for(unsigned i=0;i<pages;++i)dump[(unsigned long)i*4096]=1;
#endif
 printf("%lld\n",ans>NEG/2?ans:-1);return 0;
}

CompilationN/AN/ACompile OKScore: N/A

Subtask #1 Testcase #1221.925 ms363 MB + 500 KBAcceptedScore: 100

Subtask #1 Testcase #2302.162 ms364 MB + 484 KBAcceptedScore: 0

Subtask #1 Testcase #3266.771 ms362 MB + 1000 KBAcceptedScore: 0

Subtask #1 Testcase #4233.749 ms365 MB + 932 KBAcceptedScore: 0

Subtask #1 Testcase #5230.47 ms360 MB + 268 KBAcceptedScore: 0

Subtask #1 Testcase #6471.819 ms358 MB + 20 KBAcceptedScore: 0

Subtask #1 Testcase #7449.616 ms359 MB + 972 KBAcceptedScore: 0

Subtask #1 Testcase #8250.269 ms352 MB + 792 KBAcceptedScore: 0

Subtask #1 Testcase #9220.325 ms353 MB + 796 KBAcceptedScore: 0

Subtask #1 Testcase #10226.795 ms369 MB + 792 KBAcceptedScore: 0

Subtask #1 Testcase #11306.345 ms355 MB + 196 KBAcceptedScore: 0

Subtask #1 Testcase #12221.245 ms352 MB + 696 KBAcceptedScore: 0

Subtask #1 Testcase #13216.631 ms356 MB + 260 KBAcceptedScore: 0

Subtask #1 Testcase #14499.81 ms341 MB + 168 KBAcceptedScore: 0

Subtask #1 Testcase #15221.376 ms347 MB + 772 KBAcceptedScore: 0

Subtask #1 Testcase #16254.891 ms374 MB + 168 KBAcceptedScore: 0

Subtask #1 Testcase #17221.123 ms367 MB + 512 KBAcceptedScore: 0

Subtask #1 Testcase #18618.451 ms372 MB + 328 KBAcceptedScore: 0

Subtask #1 Testcase #19220.545 ms346 MB + 912 KBAcceptedScore: 0

Subtask #1 Testcase #20228.134 ms343 MB + 592 KBAcceptedScore: 0

Subtask #1 Testcase #21223.225 ms354 MB + 160 KBAcceptedScore: 0

Subtask #1 Testcase #22223.066 ms357 MB + 752 KBAcceptedScore: 0

Subtask #1 Testcase #23242.861 ms340 MB + 468 KBAcceptedScore: 0

Subtask #1 Testcase #24235.236 ms355 MB + 360 KBAcceptedScore: 0

Subtask #1 Testcase #25229.137 ms340 MB + 264 KBAcceptedScore: 0

Subtask #1 Testcase #26242.581 ms345 MB + 96 KBAcceptedScore: 0

Subtask #1 Testcase #27258.729 ms347 MB + 616 KBAcceptedScore: 0

Subtask #1 Testcase #28236.51 ms349 MB + 136 KBAcceptedScore: 0

Subtask #1 Testcase #29259.595 ms348 MB + 208 KBAcceptedScore: 0

Subtask #1 Testcase #30234.154 ms347 MB + 172 KBAcceptedScore: 0

Subtask #1 Testcase #31231.395 ms364 MB + 408 KBAcceptedScore: 0

Subtask #1 Testcase #32220.678 ms342 MB + 984 KBAcceptedScore: 0

Subtask #1 Testcase #33222.788 ms366 MB + 164 KBAcceptedScore: 0

Subtask #1 Testcase #34574.758 ms343 MB + 544 KBAcceptedScore: 0

Subtask #1 Testcase #35254.154 ms371 MB + 652 KBAcceptedScore: 0

Subtask #1 Testcase #36244.737 ms344 MB + 856 KBAcceptedScore: 0

Subtask #1 Testcase #37220.563 ms353 MB + 196 KBAcceptedScore: 0

Subtask #1 Testcase #38228.854 ms374 MB + 712 KBAcceptedScore: 0

Subtask #1 Testcase #39227.822 ms374 MB + 144 KBAcceptedScore: 0

Subtask #1 Testcase #40260.427 ms365 MB + 52 KBAcceptedScore: 0

Subtask #1 Testcase #41241.253 ms364 MB + 740 KBAcceptedScore: 0

Subtask #1 Testcase #42230.238 ms349 MB + 228 KBAcceptedScore: 0

Subtask #1 Testcase #43227.527 ms369 MB + 688 KBAcceptedScore: 0

Subtask #1 Testcase #44250.772 ms359 MB + 932 KBAcceptedScore: 0

Subtask #1 Testcase #45223.481 ms365 MB + 188 KBAcceptedScore: 0

Subtask #1 Testcase #46230.424 ms345 MB + 972 KBAcceptedScore: 0

Subtask #1 Testcase #47219.245 ms374 MB + 420 KBAcceptedScore: 0

Subtask #1 Testcase #48232.871 ms354 MB + 408 KBAcceptedScore: 0

Subtask #1 Testcase #49283.824 ms371 MB + 284 KBAcceptedScore: 0

Subtask #1 Testcase #50278.672 ms365 MB + 940 KBAcceptedScore: 0


Judge Duck Online | 评测鸭在线
Server Time: 2026-09-12 12:32:30 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠