oj.uz

답안 #71238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71238 2018-08-24T08:42:03 Z khohko 매트 (KOI15_mat) C++17
8 / 100
 47 ms 24528 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define MAX ((ll)(1e17+100))
#define MX ((ll)(1e6+100))
#define ARRS ((ll)(2e6+100))
#define HS ((ll)(1049))
#define MOD ((ll)(1000000861))
#define EP ((double)(1e-9))
#define LG 21
#define mul(a,b) a=((a)*(b))%MOD
using namespace std;

string s,t;
vector<pair<pair<ll,ll> ,pair<ll,ll> > > a;
vector<pair<pair<ll,ll> ,pair<ll,ll> > > b;
ll dp[4100][4100];
int main(){
	#ifdef KHOKHO
		freopen("in.in","r",stdin);
		freopen("out.out","w",stdout);
	#endif
	ll n,w,l,r,d,k,c;
	cin>>n>>w;
	a.pb({{0,0},{-1,0}});
	b.pb({{0,0},{w+1,0}});
	for(int i=0; i<n; i++){
		cin>>k;
		if(k){
			cin>>l>>r>>d>>c;
			a.pb({{l,r},{d,c}});
		}
		else {
			cin>>l>>r>>d>>c;
			b.pb({{l,r},{w-d,c}});
		}
	}
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	for(int i=0; i<=a.size(); i++)
		for(int j=0; j<=b.size(); j++)
			dp[i][j]=-MAX;
	dp[0][0]=0;
	ll pas=0;
	for(int i=0; i<=a.size(); i++){
		for(int j=0; j<=b.size(); j++){
			if(!i&&!j)continue;
			if(b[j].fr.fr<=a[i].fr.fr&&a[i].sc.fr<=b[j].sc.fr){
				for(int k=0; k<a.size(); k++){
					if(a[k].fr.sc<=a[i].fr.fr)
						dp[i][j]=max(dp[i][j],dp[k][j]+a[i].sc.sc);
				}
			}

			if(b[j].fr.fr>=a[i].fr.fr&&a[i].sc.fr<=b[j].sc.fr){
				for(int k=0; k<b.size(); k++){
					if(b[k].fr.sc<=b[j].fr.fr)
						dp[i][j]=max(dp[i][j],dp[i][k]+b[j].sc.sc);
				}
			}
			//cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;

			pas=max(pas,dp[i][j]);
		}
	}
	cout<<pas;
}

Compilation message

mat.cpp: In function 'int main()':
mat.cpp:44:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<=a.size(); i++)
               ~^~~~~~~~~~
mat.cpp:45:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0; j<=b.size(); j++)
                ~^~~~~~~~~~
mat.cpp:49:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<=a.size(); i++){
               ~^~~~~~~~~~
mat.cpp:50:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0; j<=b.size(); j++){
                ~^~~~~~~~~~
mat.cpp:53:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int k=0; k<a.size(); k++){
                  ~^~~~~~~~~
mat.cpp:60:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int k=0; k<b.size(); k++){
                  ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 3 ms 592 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Incorrect 3 ms 592 KB Output isn't correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 1080 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 1080 KB Output is correct
2 Incorrect 42 ms 1080 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 24528 KB Output isn't correct
2 Halted 0 ms 0 KB -