# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237068 | MrRobot_28 | Hokej (COCI17_hokej) | C++17 | 493 ms | 24484 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
bool cmp(pair <int, pair <int, int> > a, pair <int, pair <int, int> > b)
{
if(a.first == b.first)
{
return a.second.first > b.second.first;
}
return a.first < b.first;
}
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;
vector <int> allsum(n);
for(int i = 0; i < n; i++)
{
if(timer == 0)
{
allsum[x[i].second] = x[i].first.second;
sum += x[i].first.second * x[i].first.first;
timer += x[i].first.second;
}
else if(timer + x[i].first.second > m){
allsum[x[i].second] += m - timer;
sum +=(m - timer)* x[i].first.first;
if(cnt == 6)
{
timer = m;
}
else
{
cnt++;
allsum[x[i].second] += x[i].first.second - (m - timer);
timer = x[i].first.second - (m - timer);
sum += timer * x[i].first.first;
}
}
else{
sum += x[i].first.second * x[i].first.first;
allsum[x[i].second] = x[i].first.second;
timer += x[i].first.second;
}
if(cnt == 6 && timer == m)
{
break;
}
}
vector <pair <int, int> > p;
for(int i = 0; i < n; i++)
{
p.push_back({allsum[i], i});
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
timer = 0;
cnt = 1;
for(int i = 0; i < p.size(); i++)
{
if(p[i].first == 0)
{
break;
}
int v = p[i].second;
if(timer == 0)
{
timer += p[i].first;
start[cnt - 1] = p[i].second;
}
else if(timer + p[i].first > m)
{
ans.push_back({timer, {p[i - 1].second, p[i].second}});
timer = p[i].first - (m - timer);
cnt++;
start[cnt - 1] = p[i].second;
}
else
{
ans.push_back({timer, {p[i - 1].second, p[i].second}});
timer += p[i].first;
}
if(timer == m)
{
timer = 0;
cnt++;
}
}
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(), cmp);
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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |