답안 #62173 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
62173	2018-07-27T16:51:30 Z	KLPP	Bulldozer (JOI17_bulldozer)	C++14	20 / 100	2000 ms	63104 KB

bulldozer

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long int lld;
typedef pair<pair<lld,lld>,lld> piii;
int cmp(pair<pair<lld,lld>,pair<int,int> > x, pair<pair<lld,lld>,pair<int,int> > y){
	if(x.first.first*y.first.second>x.first.second*y.first.first){
		return true;
	}return false;
}

int main(){
	int n;
	scanf("%d",&n);
	piii arr[n];
	bool b=true;
	for(int i=0;i<n;i++){
		scanf("%lld %lld %lld",&arr[i].first.first,&arr[i].first.second,&arr[i].second);
		if(arr[i].first.first!=0)b=false;
	}sort(arr,arr+n);
	if(b){
		lld ans=0;
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			lld can=0;
			for(int k=i;k<=j;k++){
				can+=arr[k].second;
			}ans=max(ans,can);
		}
	}printf("%lld\n",ans);





	return 0;
	}
	lld ans=0;
	if(n==1){
		if(arr[0].second>0){
			cout<<arr[0].second<<endl;
			return 0;
		}cout<<0<<endl;
		return 0;
	}
	vector<pair<pair<lld,lld>,pair<int,int> > > array;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			pair<lld,lld> p1=pair<lld,lld>(arr[j].first.second-arr[i].first.second,arr[j].first.first-arr[i].first.first);
			
			array.push_back(pair<pair<lld,lld>,pair<int,int> >(p1,pair<int,int>(i,j)));
		}
	}sort(array.begin(),array.end(),cmp);
	/*for(int i=0;i<array.size();i++){
		cout<<array[i].first.first<<" "<<array[i].first.second<<" "<<array[i].second.first<<" "<<array[i].second.second<<endl;
	}*/	
	pair<int,int> changes[array.size()];
	for(int i=0;i<array.size();i++){
		changes[i].first=array[i].second.first;
		changes[i].second=array[i].second.second;
	}
	int per[n];
	for(int i=0;i<n;i++)per[i]=i;
	for(int i=0;i<array.size();i++){
		int x,y;
		for(int j=0;j<n;j++){
			if(per[j]==array[i].second.first)x=j;
			if(per[j]==array[i].second.second)y=j;
		}
		swap(per[x],per[y]);
		lld DP[n];
		lld zero=0;
		DP[0]=max(zero,arr[per[0]].second);
		ans=max(ans,DP[0]);
		for(int j=1;j<n;j++){
			DP[j]=max(zero,DP[j-1]+arr[per[j]].second);
			ans=max(ans,DP[j]);
		}
	}cout<<ans<<endl;
	
	

	return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:60:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<array.size();i++){
              ~^~~~~~~~~~~~~
bulldozer.cpp:66:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<array.size();i++){
              ~^~~~~~~~~~~~~
bulldozer.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
bulldozer.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld",&arr[i].first.first,&arr[i].first.second,&arr[i].second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bulldozer.cpp:67:7: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int x,y;
       ^
bulldozer.cpp:67:9: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int x,y;
         ^

Subtask #1
0 / 5.0

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

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	640 KB	Output is correct
2	Correct	4 ms	640 KB	Output is correct
3	Correct	4 ms	640 KB	Output is correct
4	Correct	4 ms	640 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	640 KB	Output is correct
8	Correct	4 ms	640 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	640 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	7 ms	512 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	4 ms	640 KB	Output is correct
22	Correct	4 ms	640 KB	Output is correct
23	Correct	4 ms	640 KB	Output is correct
24	Correct	4 ms	640 KB	Output is correct
25	Correct	4 ms	640 KB	Output is correct
26	Correct	3 ms	640 KB	Output is correct
27	Correct	4 ms	640 KB	Output is correct
28	Correct	4 ms	640 KB	Output is correct
29	Correct	4 ms	640 KB	Output is correct
30	Correct	4 ms	640 KB	Output is correct
31	Correct	4 ms	704 KB	Output is correct
32	Correct	4 ms	676 KB	Output is correct

Subtask #3
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	640 KB	Output is correct
2	Correct	4 ms	640 KB	Output is correct
3	Correct	4 ms	640 KB	Output is correct
4	Correct	4 ms	640 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	640 KB	Output is correct
8	Correct	4 ms	640 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	640 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	7 ms	512 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	4 ms	640 KB	Output is correct
22	Correct	4 ms	640 KB	Output is correct
23	Correct	4 ms	640 KB	Output is correct
24	Correct	4 ms	640 KB	Output is correct
25	Correct	4 ms	640 KB	Output is correct
26	Correct	3 ms	640 KB	Output is correct
27	Correct	4 ms	640 KB	Output is correct
28	Correct	4 ms	640 KB	Output is correct
29	Correct	4 ms	640 KB	Output is correct
30	Correct	4 ms	640 KB	Output is correct
31	Correct	4 ms	704 KB	Output is correct
32	Correct	4 ms	676 KB	Output is correct
33	Execution timed out	2061 ms	63104 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	640 KB	Output is correct
2	Correct	4 ms	640 KB	Output is correct
3	Correct	4 ms	640 KB	Output is correct
4	Correct	4 ms	640 KB	Output is correct
5	Correct	4 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	640 KB	Output is correct
8	Correct	4 ms	640 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	640 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	7 ms	512 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	4 ms	640 KB	Output is correct
22	Correct	4 ms	640 KB	Output is correct
23	Correct	4 ms	640 KB	Output is correct
24	Correct	4 ms	640 KB	Output is correct
25	Correct	4 ms	640 KB	Output is correct
26	Correct	3 ms	640 KB	Output is correct
27	Correct	4 ms	640 KB	Output is correct
28	Correct	4 ms	640 KB	Output is correct
29	Correct	4 ms	640 KB	Output is correct
30	Correct	4 ms	640 KB	Output is correct
31	Correct	4 ms	704 KB	Output is correct
32	Correct	4 ms	676 KB	Output is correct
33	Execution timed out	2061 ms	63104 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

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

답안 #62173

Compilation message

Subtask #1 0 / 5.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 35.0

Subtask #4 0 / 20.0

Subtask #5 0 / 20.0

Subtask #1
0 / 5.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 35.0

Subtask #4
0 / 20.0

Subtask #5
0 / 20.0