제출 #644381

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
644381		Iwanttobreakfree	Med (COCI22_med)	C++17	50 / 50	1 ms	324 KiB

Main

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<pair<pair<int,string>,int>> bee (n);
    for (int i = 0; i < n; ++i) {
        cin >> bee[i].first.second;
        bee[i].second = i;
        for (int j = 0; j < 5; ++j){
            int x;
            cin >> x;
            bee[i].first.first -= x;
        }
    }
    sort (bee.begin(),bee.end());
    vector<pair<int,int>> ans (n);
    for (int i = 0; i < n; ++i) {
        //cout << bee[i].first.first << '\n';
        int b = i, w = i;
        for (int j = 0; j < i; ++j) {
            if (-bee[i].first.first+500 > -bee[j].first.first) {
                b = j;
                break;
            }
            if (-bee[i].first.first+500 == -bee[j].first.first and bee[i].first.second < bee[j].first.second) {
                b = j;
                break;
            }
        }
        for (int j = i+1; j < n; ++j) {
            if (-bee[i].first.first < -bee[j].first.first+500) {
                w = j;
            }
            if (-bee[i].first.first-500 == -bee[j].first.first and bee[i].first.second > bee[j].first.second) {
                w = j;
            }
        }
        ans[bee[i].second] = {b+1,w+1};
    }
    for (int i = 0; i < n; ++i) cout << ans[i].first << ' ' << ans[i].second << '\n';
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40