oj.uz

Submission #1077214

# Submission time Handle Problem Language Result Execution time Memory
1077214 2024-08-27T03:07:36 Z vjudge1 Bulldozer (JOI17_bulldozer) C++17
5 / 100
 12 ms 624 KB 
#include <bits/stdc++.h>
using namespace std;
#define ld long double
long double dis(ld a,ld x,ld y)
{
	return (abs(a*x-y))/sqrt(a*a+1);
}
struct node
{
	long long x,y,w;
}p[2009];
int n;
const ld pi=acos(-1); 
ld rad(ld x)
{
	return x*pi/180;
}
struct pos
{
	bool is;
	ld x;
	long long w;
};
struct cmp
{
	bool operator() (pos a,pos b)
	{
		if(a.is!=b.is)return a.is<b.is;
		if(a.is==0)return a.x>b.x;
		return a.x<b.x;
	}
};
const ld E=1e-8;
long long f[2009];
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>p[i].x>>p[i].y>>p[i].w;
	long long kq=0;
	for(ld j=-1000;j<=1000;j++)
	{
		vector<pos>t;
		ld a=j;
		for(int i=1;i<=n;i++)
		{
			if(p[i].y>=a*p[i].x)t.push_back({1,dis(a,p[i].x,p[i].y),p[i].w});
			else t.push_back({0,dis(a,p[i].x,p[i].y),p[i].w});
		}
		sort(t.begin(),t.end(),cmp());
		int cnt=0;		
		for(int i=1;i<=n;i++)f[i]=0;
		cnt++;
		f[cnt]=t[0].w;
		for(int i=1;i<t.size();i++)
		{
			if(t[i].is==t[i-1].is&&abs(t[i].x-t[i-1].x)<E)f[cnt]+=t[i].w;
			else
			{
				cnt++;
				f[cnt]=t[i].w;
			}
		}
		long long tam=0, pre = 0;
		for(int i=1;i<=cnt;i++)
		{
			tam += f[i];
			kq = max(kq, tam - pre);
			pre = min(pre, tam);
		}
		kq=max(kq,tam);
		// if(kq==21)
		// {
		// 	cout<<a<<'\n';
		// 	for(int i=1;i<=cnt;i++)cout<<f[i]<<'\n';
		// 	for(auto i:t)cout<<i.is<<' '<<i.x<<' '<<i.w<<endl;
		// 	break;
		// }

	}
	cout<<kq;
	return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:57:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pos>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   for(int i=1;i<t.size();i++)
      |               ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 348 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 10 ms 480 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 9 ms 480 KB Output is correct
6 Correct 9 ms 480 KB Output is correct
7 Correct 12 ms 624 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 9 ms 476 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 348 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 10 ms 480 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 9 ms 480 KB Output is correct
6 Correct 9 ms 480 KB Output is correct
7 Correct 12 ms 624 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 9 ms 476 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Incorrect 9 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -