답안 #780563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780563	2023-07-12T10:16:15 Z	vjudge1	Go (COCI18_go)	C++17	70 / 100	145 ms	342012 KB

go

#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000;
const lo li = 1002;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t[li],b[li],dp[2018][104][104][4];
int cev;
string s;
vector<int> v;

inline int in(){
	int x;
	scanf("%d",&x);
	return x;
}

inline int f(int tim,int l,int r,int deg,int kim){
	int cevv=0;
	if(l<=1 && r>=m)return 0;
	//~ cout<<tim<<" () "<<l<<" () "<<r<<" () "<<kim<<" () "<<t[l-1]<<endl;
	if(~dp[deg][l][r][kim])return dp[deg][l][r][kim];
	if(kim==0){
		if(l>1){
			cevv=max(cevv,f(tim+a[l]-a[l-1],l-1,r,0,deg)+(tim+a[l]-a[l-1]<t[l-1]?b[l-1]:0));
		}
		if(r<m){
			cevv=max(cevv,f(tim+a[r+1]-a[l],l,r+1,1,deg+1)+(tim+a[r+1]-a[l]<t[r+1]?b[r+1]:0));
		}
	}
	else{
		if(l>1){
			cevv=max(cevv,f(tim+a[r]-a[l-1],l-1,r,0,deg+1)+(tim+a[r]-a[l-1]<t[l-1]?b[l-1]:0));
		}
		if(r<m){
			cevv=max(cevv,f(tim+a[r+1]-a[r],l,r+1,1,deg)+(tim+a[r+1]-a[r]<t[r+1]?b[r+1]:0));
		}
	}
	return dp[deg][l][r][kim]=cevv;
}

int main(void){
	n=in(),k=in(),m=in();
	memset(dp,-1,sizeof(dp));
	for(int i=1;i<=m;i++){
		a[i]=in(),b[i]=in(),t[i]=in();
	}
	int l=0,r=0;
	for(int i=1;i<=m;i++){
		if(a[i]<=k){l=i;r=i+1;}
	}
	int at=f(k-a[l],l,l,0,0)+(k-a[l]<t[l]?b[l]:0);
	memset(dp,-1,sizeof(dp));
	int kat=f(a[r]-k,r,r,1,0)+(a[r]-k<t[r]?b[r]:0);
	if(l==0)at=0;
	if(r==m+1)at=0;
	printf("%d\n",max(at,kat));
	return 0;
}

Compilation message

go.cpp: In function 'int in()':
go.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  scanf("%d",&x);
      |  ~~~~~^~~~~~~~~

Subtask #1

70.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	142 ms	341996 KB	Output isn't correct
2	Correct	131 ms	342012 KB	Output is correct
3	Correct	131 ms	341968 KB	Output is correct
4	Correct	136 ms	341924 KB	Output is correct
5	Incorrect	126 ms	341900 KB	Output isn't correct
6	Correct	128 ms	341968 KB	Output is correct
7	Incorrect	142 ms	341964 KB	Output isn't correct
8	Correct	145 ms	341912 KB	Output is correct
9	Correct	126 ms	341924 KB	Output is correct
10	Correct	128 ms	341992 KB	Output is correct