제출 #1282825

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1282825		lyra_g13	Lightning Rod (NOI18_lightningrod)	C++20	14 / 100	418 ms	234320 KiB

Main

#include <bits/stdc++.h>
using ll = long long;
using namespace std;
inline int readInt() {
    int x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x;
}

int x[10000000], y[10000000];

int main(){
	int n = readInt();
	for(int i = 0; i < n; i++) {
		x[i] = readInt();
		y[i] = readInt();
	}
  if(n>=200000 and n>=2){
     std::vector<ll>l(n);
     std::vector<ll>r(n);
       l[0] = -1e9;
      r[n-1] = -1e9;

      for(int i = 1 ; i < n; i++){
      l[i] = std::max( l[i-1] , (ll)(x[i-1] + y[i-1]));
     }
      for(int i = n-2 ; i >=0; i--){
      r[i] = std::max(r[i+1] , (ll)(y[i+1] - x[i+1]));
     }
     
     ll c = 0;
     for(int i = 0 ; i < n ; i++){
       
          if(r[i] >= y[i] - x[i]) continue;
          if(l[i] >= y[i] + x[i] ) continue;
          c++;
       }
     
     std::cout << c;
  }
  
  
  else{
  std::cout << n;
  }
  
	return 0;
}

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