Submission #483272

#	Time	Username	Problem	Language	Result	Execution time	Memory
483272		keertan	Global Warming (CEOI18_glo)	C++17	0 / 100	148 ms	15912 KiB

glo

#include <cstdio>
#include <vector>
#include <algorithm>
#include "bits/stdc++.h"
using namespace std;
typedef pair<long long, long long> pii;
int N;
vector<pii> candies;
vector<long long> wagons;
vector<pair<pii, int> > output;
int main() {
    cin>>N;
    for (int i = 0; i < N; i++) {
        long long p, t;
        cin>>p>>t;
        candies.push_back(pii(p + t, t - p));
    }
    sort(candies.begin(), candies.end());
    for (int i = 0; i < N; i++) {
        long long a = candies[i].first, b = -  candies[i].second;
        int pos = lower_bound(wagons.begin(), wagons.end(), b) - wagons.begin();
        if (pos == (int) wagons.size()) {
            wagons.push_back(b);
        } else {
             wagons[pos] = b;
        }
        
        output.push_back(make_pair(pii((a + b) / 2, (a - b) / 2), pos + 1));
    }
    cout<< wagons.size()<<"\n";
    
    for (int i = 0; i < N; i++) {
        cout<<output[i].first.first<<" "<< output[i].first.second<<" "<< output[i].second<<"\n";
    }
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25