제출 #519663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
519663		ac2hu	Arcade (NOI20_arcade)	C++14	0 / 100	0 ms	204 KiB

Arcade

#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
struct mov{
    int t,loc;
} a[N];
int n,m;
signed main(){
	iostream::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
    cin >> n >> m;
    for(int i = 0;i<m;i++){
        cin >> a[i].t;
    }
    for(int i =0 ;i<m;i++){
        cin >> a[i].loc;
    }
    sort(a,a + m,[&](mov a,mov b){
        return a.t < b.t||(a.t == b.t && a.loc < b.loc);
    });
    vector<int> arms;
    for(int i = 0;i<m;i++){
        pair<int,int> idx = {1e9,-1};
        for(int j = 0;j<(int)arms.size();j++){
            int e = arms[j];
            if(abs(a[e].loc - a[i].loc) <= abs(a[e].t - a[i].t)){
                int v = abs(a[e].t - a[i].t) - abs(a[e].loc - a[i].loc);
                idx = {v,e};
            }
        }
        if(idx.second == -1){
            arms.push_back(i);
        }
        else{
            arms[idx.second] = i;
        }
    }
    cout << arms.size() << "\n";
    // int l = 1,r = m;
    // while(l < r){
    //     int mid = (l + r - 1)/2;
    //     if(check(mid))
    //         r = mid;
    //     else 
    //         l = mid + 1;
    // }
    // cout << l << "\n";
}

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