結果

問題 No.1864 Shortest Paths Counting
ユーザー kmjp
提出日時 2022-03-04 23:22:19
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 86 ms / 2,000 ms
コード長 1,873 bytes
コンパイル時間 2,070 ms
コンパイル使用メモリ 208,296 KB
最終ジャッジ日時 2025-01-28 06:28:13
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/istream:41,
                 from /usr/include/c++/13/sstream:40,
                 from /usr/include/c++/13/complex:45,
                 from /usr/include/c++/13/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127,
                 from main.cpp:1:
In member function ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]’,
    inlined from ‘void solve()’ at main.cpp:69:8:
/usr/include/c++/13/ostream:204:25: warning: ‘ret’ may be used uninitialized [-Wmaybe-uninitialized]
  204 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function ‘void solve()’:
main.cpp:63:12: note: ‘ret’ was declared here
   63 |         ll ret;
      |            ^~~

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll X[202020],Y[202020];
ll mo=998244353;
template<class V, int ME> class BIT_mod {
public:
	V bit[1<<ME];
	BIT_mod(){ZERO(bit);};
	V operator()(int e) { if(e<0) return 0; ll s=0;e++;while(e) s+=bit[e-1],e-=e&-e; return s%mo;}
	void add(int e,V v) { e++; while(e<=1<<ME) { bit[e-1]+=v; bit[e-1] -= (bit[e-1]>=mo)?mo:0; e+=e&-e;}}
};
BIT_mod<int,20> bt;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>x>>y;
		X[i]=x+y;
		Y[i]=x-y;
	}
	for(i=N-1;i>=0;i--) {
		X[i]-=X[0];
		Y[i]-=Y[0];
	}
	if(X[N-1]<0) {
		FOR(i,N) X[i]=-X[i];
	}
	if(Y[N-1]<0) {
		FOR(i,N) Y[i]=-Y[i];
	}
	vector<ll> Ys;
	vector<pair<ll,int>> P;
	FOR(i,N) {
		if(X[i]<X[0]||X[i]>X[N-1]) continue;
		if(Y[i]<Y[0]||Y[i]>Y[N-1]) continue;
		Ys.push_back(Y[i]);
	}
	sort(ALL(Ys));
	FOR(i,N) {
		if(i==0) continue;
		if(X[i]<X[0]||X[i]>X[N-1]) continue;
		if(Y[i]<Y[0]||Y[i]>Y[N-1]) continue;
		Y[i]=lower_bound(ALL(Ys),Y[i])-Ys.begin();
		P.push_back({X[i],Y[i]});
	}
	sort(ALL(P));
	ll ret;
	bt.add(0,1);
	FORR2(x,y,P) {
		ret=bt(y);
		bt.add(y,ret);
	}
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}
0