#519734 (C++14) No.1137 Circles

提出ソース

結果

問題	No.1137 Circles
ユーザー	HEXAebmr
提出日時	2020-07-28 11:17:03
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	62 ms / 2,000 ms
コード長	9,624 bytes
コンパイル時間	1,753 ms
コンパイル使用メモリ	132,088 KB
実行使用メモリ	7,552 KB
最終ジャッジ日時	2024-06-28 20:37:53
合計ジャッジ時間	3,228 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 5,760 KB
testcase_01	AC	58 ms 7,552 KB
testcase_02	AC	6 ms 7,296 KB
testcase_03	AC	28 ms 7,424 KB
testcase_04	AC	43 ms 7,424 KB
testcase_05	AC	11 ms 7,424 KB
testcase_06	AC	49 ms 7,424 KB
testcase_07	AC	23 ms 7,296 KB
testcase_08	AC	51 ms 7,296 KB
testcase_09	AC	17 ms 7,424 KB
testcase_10	AC	26 ms 7,424 KB
testcase_11	AC	31 ms 7,424 KB
testcase_12	AC	60 ms 7,552 KB
testcase_13	AC	19 ms 7,552 KB
testcase_14	AC	62 ms 7,552 KB
testcase_15	AC	21 ms 7,424 KB
testcase_16	AC	31 ms 7,424 KB
testcase_17	AC	7 ms 7,424 KB
testcase_18	AC	50 ms 7,424 KB
testcase_19	AC	17 ms 7,424 KB
testcase_20	AC	14 ms 7,296 KB
testcase_21	AC	5 ms 5,760 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

// modint

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

void printVector(vector<double> a, int x){//ベクトル出力　有効数字x桁
  rep(i,a.size()){
    cout << stpr(x) << a[i] << endl;
  }
}

void printMatrix(vector<vector<double>> a,int x){//行列出力　有効数字x桁
  rep(i,a.size()){
    rep(j,a[i].size()){
      cout << stpr(x) << a[i][j] << " ";
    }
    cout << endl;
  }
}

vector<double> VectorAdd(vector<double> a,vector<double> b){
  vector<double> c(a.size());
  rep(i,a.size()){
    c[i]=a[i]+b[i];
  }
  return c;
}

vector<double> VectorSubtract(vector<double> a,vector<double> b){
  vector<double> c(a.size());
  rep(i,a.size()){
    c[i]=a[i]-b[i];
  }
  return c;
}

vector<double> VectorMultiply(vector<double> a,int b){
  vector<double> c(a.size());
  rep(i,a.size()){
    c[i]=a[i]*b;
  }
  return c;
}

vector<vector<double>> MatrixSubtract(vector<vector<double>> a,vector<vector<double>> b){
  vector<vector<double>> c(a.size(),vector<double>(a[0].size()));
  rep(i,a.size()){
    rep(j,a[i].size()){
      c[i][j]=a[i][j]-b[i][j];
    }
  }
  return c;
}

vector<vector<double>> MatrixAdd(vector<vector<double>> a,vector<vector<double>> b){  // 行列と行列の和
  // a.size() = aの行数　
  // a[0].size() = aの列数　
  vector<vector<double>> c(a.size(),vector<double>(a[0].size()));  // 行数がa.size()、列数がa[0].size()の配列の配列を確保する
  rep(i,a.size()){
    rep(j,a[i].size()){
      c[i][j]=a[i][j]+b[i][j];
    }
  }
  return c; // 行列を返す
}

vector<vector<double>> IntMatrixMultiply(vector<vector<double>> a,int b){
  vector<vector<double>> c(a.size(),vector<double>(a[0].size()));
  rep(i,a.size()){
    rep(j,a[i].size()){
      c[i][j]=a[i][j]*b;
    }
  }
  return c;
}

vector<double> MatrixVectorMultiply(vector<vector<double>> a,vector<double> b){
  vector<double> c(a.size());
  rep(i,a.size()){
    double sum=0;
    rep(j,a[i].size()){
      sum+=a[i][j]*b[j];
    }
    c[i]=sum;
  }
  return c;
}

vector<double> VectorMatrixMultiply(vector<double> a,vector<vector<double>> b){
  vector<double> c(b[0].size());
  rep(i,b[0].size()){
    double sum=0;
    rep(j,a.size()){
      sum+=a[j]*b[j][i];
    }
    c[i]=sum;
  }
  return c;
}

vector<vector<double>> MatrixMatrixMultiply(vector<vector<double>> a,vector<vector<double>> b){
  vector<vector<double>> c(a.size(),vector<double>(b[0].size(),0.0));
  rep(i,a.size()){
    rep(j,b[0].size()){
      rep(k,a[0].size()){
        c[i][j]+=a[i][k]*b[k][j];
      }
    }
  }
  return c;
}

double VectorNorm1(vector<double> a){
  double norm = 0;
  rep(i,a.size()){
    norm+=fabs(a[i]);
  }
  return norm;
}

double VectorNorm2(vector<double> a){
  double norm = 0;
  rep(i,a.size()){
    norm+=a[i]*a[i];
  }
  return sqrt(norm);
}

double VectorNormInfinity(vector<double> a){
  double norm = 0;
  rep(i,a.size()){
    norm=max(norm,a[i]);
  }
  return norm;
}

double MatrixNorm1(vector<vector<double>> a){
  double norm = 0;
  rep(i,a[0].size()){
    double sum=0;
    rep(j,a.size()){
      sum+=fabs(a[j][i]);
    }
    norm=max(norm,sum);
  }
  return norm;
}

double MatrixNormInfinity(vector<vector<double>> a){
  double norm = 0;
  rep(i,a.size()){
    double sum=0;
    rep(j,a[i].size()){
      sum+=fabs(a[i][j]);
    }
    norm=max(norm,sum);
  }
  return norm;
}

void PreDelete(vector<vector<double>> &a,vector<double> &b){ //前進消去過程
  rep(i,a.size()-1){
    Rep(j,i+1,a.size()){
      double X=a[j][i]/a[i][i];
      rep(k,a.size()+1){
        a[j][k]-=a[i][k]*X;
      }
      b[j]-=b[i]*X;
    }
  }
}

void BackReplace(vector<vector<double>> &a,vector<double> &b){ //後退代入過程
  rrep(i,a.size()){
    double key=b[i];
    if(i==a.size()-1){
      b[i]=b[i]/a[i][i];
    }
    else{
      Rep(j,i+1,a.size()){
        key-=a[i][j]*b[j];
      }
      b[i]=key/a[i][i];
    }
  }
}

vector<vector<double>> LUdecompfirst(vector<vector<double>> a){  // LU分解の行列を作るまで
  vector<vector<double>> C(a.size(),vector<double>(a.size(),0)),LU(a.size());
  rep(key,a.size()-1){
    rep(i,a.size()){
      rep(j,a.size()){
        if(j>i) C[i][j]=0;
        else if(j==i) C[i][j]=1;
        else if(key==j) C[i][j]=-a[i][j]/a[j][j];
        else C[i][j]=0;
      }
    }
    a = MatrixMatrixMultiply(C,a);
    Rep(i,key,a.size()) LU[key].pb(a[key][i]);
    Rep(i,key+1,a.size()) LU[i].pb(-C[i][key]);
  }
  LU[a.size()-1].pb(a[a.size()-1][a.size()-1]);
  return LU;
}

vector<double> LUdecompsecond(vector<vector<double>> LU,vector<double> B){  // LU分解の行列を使って解を求める
  vector<double> x(LU.size(),0);
  vector<double> y;
  rep(i,LU.size()){
    double SUM=B[i];
    rep(j,i) SUM-=LU[i][j]*y[j];
    y.pb(SUM);
  }
  rrep(i,LU.size()){
    double SUM=y[i];
    Rep(j,i,LU.size()) SUM-=LU[i][j]*x[j];
    SUM/=LU[i][i];
    x[i]=SUM;
  }
  return x;
}

vector<vector<ll>> Multiply_Matrix(ll lx,ll ly,ll ry,vector<vector<ll>> A_,vector<vector<ll>> B_,ll m){  //(左の行数、左の列数、右の列数、A、B、法とするmod(modを取らないときは-1)
  vector<vector<ll>> V_ (lx,vector<ll> (ry,0));
  rep(i,lx){
    rep(j,ry){
      rep(k,ly){
        V_[i][j]+=A_[i][k]*B_[k][j];
        if(m!=-1){
          V_[i][j]%=m;
        }
      }
    }
  }
  return V_;
}

// 行列累乗(上とセットで使う)


vector<vector<ll>> Matrix_Modpow(ll ms,vector<vector<ll>> A,ll e,ll m){  // サイズmsの正方行列Aのe乗をmod mで求める(modを取らないときはm=-1)
  if(e==1){
    return A;
  }
  vector<vector<ll>> cme = Matrix_Modpow(ms,A,e/2,m);
  cme = Multiply_Matrix(ms,ms,ms,cme,cme,m);
  if(e%2==1) cme = Multiply_Matrix(ms,ms,ms,cme,A,m);
  return cme;
}

ll C[400007],D[400007];

int main(){
  ll N;cin>>N;
  rep(i,N){
    ll X,R;
    cin >> X >> R;
    C[max(-100003ll,X-R+1)+100003]++;
    D[min(100003ll,X+R-1)+100003]--;
  }
  ll ma=0;
  rep(i,300000){
    if(i!=0) C[i]+=C[i-1];
    //if(i>=100003 && i<=100019) cout << i-100003 << " " << C[i];
    ma=max(C[i],ma);
    if(i!=0) C[i]+=D[i-1];
    //if(i>=100003 && i<=100019) cout << " " << C[i] << endl;
    ma=max(C[i],ma);
  }
  cout<<ma<<endl;
}

yukicoder

結果

テストケース

ソースコード