Submission #237064

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
237064	2020-06-04T11:21:45 Z	MrRobot_28	Hokej (COCI17_hokej)	C++17	72 / 120	417 ms	16696 KB

hokej

#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
	int m, n;
	cin >> m >> n;
	vector <pair <pair <int, int>, int> > x(n);
	for(int i = 0; i < n; i++){
		cin >> x[i].first.first >> x[i].first.second;
		x[i].second = i;
	}
	sort(x.begin(), x.end());
	reverse(x.begin(), x.end());
	int sum = 0;
	vector <pair <int, pair <int, int> > > ans;
	vector <int> start(6);
	int timer = 0;
	int cnt = 1;
	for(int i = 0; i < n; i++)
	{
		if(timer == 0)
		{
			sum += x[i].first.second * x[i].first.first;
			timer += x[i].first.second;
			start[cnt - 1] = x[i].second;
		}
		else if(timer + x[i].first.second > m){
			if(timer != m)
			{
			ans.push_back({timer, {x[i - 1].second, x[i].second}});
			}
			sum +=(m - timer)* x[i].first.first; 
			if(cnt == 6)
			{
				timer = m;
			}
			else
			{
				cnt++;
				start[cnt - 1] = x[i].second;
				timer = x[i].first.second - (m - timer);
				sum += timer * x[i].first.first;
			}
		}
		else{
			sum += x[i].first.second * x[i].first.first;
			ans.push_back({timer, {x[i - 1].second, x[i].second}});
			timer += x[i].first.second;
		}
		if(cnt == 6 && timer == m)
		{
			break;
		}
	}
	cout << sum << "\n";
	for(int i = 0; i < 6; i++)
	{
		cout << start[i] + 1<< " ";
	}
	cout << "\n";
	cout << ans.size() << "\n";
	sort(ans.begin(), ans.end());
	for(int i = 0; i < ans.size(); i++)
	{
		cout << ans[i].first << " " << ans[i].second.first + 1 << " " << ans[i].second.second + 1 << "\n";
	}
    return 0;
}

Compilation message

hokej.cpp: In function 'int main()':
hokej.cpp:63:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < ans.size(); i++)
                 ~~^~~~~~~~~~~~

Subtask #1

72.0 / 120.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	9 ms	512 KB	Output is correct
3	Correct	27 ms	1272 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	12 ms	768 KB	Output is correct
6	Correct	7 ms	512 KB	Output is correct
7	Incorrect	11 ms	640 KB	Output isn't correct
8	Incorrect	79 ms	3768 KB	Output isn't correct
9	Incorrect	411 ms	16568 KB	Output isn't correct
10	Incorrect	417 ms	16696 KB	Output isn't correct