제출 #300361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300361		daniel920712	카니발 티켓 (IOI20_tickets)	C++14	27 / 100	783 ms	75248 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;
struct A
{
    int where;
    int con;
}tt[1505];

vector < vector < int > > answer;
vector < int > row;
vector< vector<int> >  all;
bool have[1505][1505];
long long DP[1505][1505];
int N,M;
long long F(int here,int con)
{
    if(con>N/2) return -1e18;
    if(here==N&&con!=N/2) return -1e18;
    if(here==N) return 0;
    if(have[here][con]) return DP[here][con];
    have[here][con]=1;
    DP[here][con]=max(F(here+1,con+1)+all[here][M-1],F(here+1,con)-all[here][0]);
    return DP[here][con];
}
void F2(int here,int con)
{
    if(here==N) return;
    //printf("%d %d\n",F(here+1,con+1)+all[here][M-1],F(here+1,con)-all[here][0]);
    if(F(here+1,con+1)+all[here][M-1]>F(here+1,con)-all[here][0])
    {
        //printf("aa\n");
        F2(here+1,con+1);
        answer[here][M-1]=0;
    }
    else
    {
        F2(here+1,con);
        answer[here][0]=0;
    }

}
long long find_maximum(int k,vector< vector<int> > x)
{
    all=x;
	N=x.size();
	M=x[0].size();
	int i,j,t,ok,now;
	long long ans=0;
	for(i=0;i<M;i++) row.push_back(-1);
	for(i=0;i<N;i++) answer.push_back(row);
	if(k==1)
    {
        //for(int i=0;i<N;i++) answer[i][0]=0;
        ans=F(0,0);
        F2(0,0);
    }
	allocate_tickets(answer);
	return ans;
}

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

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:49:8: warning: unused variable 'j' [-Wunused-variable]
   49 |  int i,j,t,ok,now;
      |        ^
tickets.cpp:49:10: warning: unused variable 't' [-Wunused-variable]
   49 |  int i,j,t,ok,now;
      |          ^
tickets.cpp:49:12: warning: unused variable 'ok' [-Wunused-variable]
   49 |  int i,j,t,ok,now;
      |            ^~
tickets.cpp:49:15: warning: unused variable 'now' [-Wunused-variable]
   49 |  int i,j,t,ok,now;
      |               ^~~

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10