Submission #834288

#	Time	Username	Problem	Language	Result	Execution time	Memory
834288		Liudas	Arcade (NOI20_arcade)	C++17	0 / 100	0 ms	212 KiB

Arcade

#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
int main(){
    int N, M;
    cin >> N >> M;
    vector<pair<int, int>> arr(M);
    for(int i = 0; i < M; i ++){
        cin >> arr[i].first;
    }
    for(int i = 0; i < M; i ++){
        cin >> arr[i].second;
    }
    for(int i = 0; i < M; i ++){
        arr[i] = {arr[i].first + arr[i].second, arr[i].first - arr[i].second};
    }
    sort(arr.rbegin(), arr.rend());
    vector<pair<int, int>> ans;
    for(int i = 0; i < M; i ++){
        int id = lower_bound(ans.begin(), ans.end(), arr[i])-ans.begin();
        if(id != ans.size()){
            ans[id] = arr[i];
        }
        else{
            ans.push_back(arr[i]);
        }
    }
    cout << ans.size() << endl;
    return 0;
}

Compilation message (stderr)

Arcade.cpp: In function 'int main()':
Arcade.cpp:23:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         if(id != ans.size()){
      |            ~~~^~~~~~~~~~~~~

• 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