제출 #834206

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834206		unnick	Arcade (NOI20_arcade)	C++14	30 / 100	1 ms	340 KiB

Arcade

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);

    int n,m;
    cin >> n >> m;
    std::vector<int> times;
    std::vector<int> positions;

    for (int i = 0; i < m; i++) {
        int tmp;
        cin >> tmp;
        times.push_back(tmp);
    }

    for (int i = 0; i < m; i++) {
        int tmp;
        cin >> tmp;
        positions.push_back(tmp);
    }

    std::vector<int> idxes;

    for (int i = 0; i < m; i++) {
        idxes.push_back(i);
    }

    std::sort(idxes.begin(), idxes.end(), [times, positions](int ia, int ib){
        int sa = times[ia] + positions[ia];
        int sb = times[ib] + positions[ib];
        return sa == sb ? times[ia] < times[ib] : sa < sb;
    });

    std::vector<int> frontier;
    int num_arms = 0;

    for (int idx : idxes) {
        int selected_idx = -1;
        int selected_score = 2100000000;
        for (int i = 0; i < num_arms; i++) {
            int idx2 = frontier[i];
            if (positions[idx] == positions[idx2] && times[idx] == times[idx2]) continue;
            if (positions[idx]-positions[idx2] > times[idx]-times[idx2]) continue;
            if (selected_score < positions[idx2]) continue;
            // cout << idx2 << " is better\n";
            selected_score = positions[idx2];
            selected_idx = i;
        }
        if (selected_idx == -1) {
            // cout << "pushed" << "\n";
            frontier.push_back(idx);
            num_arms++;
        } else {
            // cout << "replaced " << selected_idx << "\n";
            frontier[selected_idx] = idx;
        }
        // cout << "frontier: ";
        // for (int i : frontier) {
        //     cout << i << " ";
        // }
        // cout << "\n";
    }

    cout << num_arms << '\n';
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 14
• Subtask 6: 0 / 20
• Subtask 7: 0 / 15