Submission #1295914

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295914		nathako9n	Lightning Rod (NOI18_lightningrod)	C++20	7 / 100	1099 ms	81556 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int N = 1e7+2;
pair<int,int> ar[N+2];
int n;
vector<int>pos;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for(int i =1;i<=n;i++){
		int x, y; cin >> x >> y;
		ar[i]= {x+y, x-y};
	}
	sort(ar+1, ar+n+1, greater<pair<int,int>>());
	vector<int> tail;
    for(int i=0;i<n;i++){
        int val = ar[i+1].second;
        auto it = lower_bound(tail.begin(), tail.end(), -val);
        if(it==tail.end()) tail.push_back(-val);
        else *it = -val;
    }
    cout << int(tail.size());
    return 0;
    
}

• Subtask 1: 0 / 4
• Subtask 2: 7 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 26
• Subtask 6: 0 / 10
• Subtask 7: 0 / 20