結果
問題 | No.1268 Fruit Rush 2 |
ユーザー | n_vip |
提出日時 | 2020-10-23 22:10:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 393 ms / 2,000 ms |
コード長 | 3,183 bytes |
コンパイル時間 | 1,924 ms |
コンパイル使用メモリ | 141,968 KB |
最終ジャッジ日時 | 2025-01-15 13:09:46 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
#include <string>#include <vector>#include<iostream>#include<cstdio>#include<cstdlib>#include<stack>#include<queue>#include<cmath>#include<algorithm>#include<functional>#include<list>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_map>#include<unordered_set>#include<cstring>#include<sstream>#include<complex>#include<iomanip>#include<numeric>#include<cassert>#include<random>#define X first#define Y second#define pb push_back#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))#define peat(X,Y) for (;(X) < (Y);++(X))#define all(X) (X).begin(),(X).end()#define rall(X) (X).rbegin(),(X).rend()#define eb emplace_back#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())#define Endl endl#define NL <<"\n"#define cauto const autousing namespace std;using ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T> using vv=vector<vector<T>>;template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}//#undef NUIP#ifdef NUIP#include "benri.h"#else#define out(args...)#endif#ifdef __cpp_init_capturestemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}#endiftemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}template<class T=ll> T read(){ T re; cin>>re; return move(re);}template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}vv<int> readG(const int &n){ return readG(n,n-1);}const ll MOD=1e9+7; //998244353int main(){ios_base::sync_with_stdio(false); cin.tie(0);cout<<fixed<<setprecision(0);cauto n=read();cauto vs=readV(n);set<ll> ex(all(vs));map<ll,ll> dp;for(cauto v:vs) dp[v]=1;ll re=0;while(dp.size()){cauto [i,cnt]=*dp.begin(); dp.erase(dp.begin());re+=cnt;if(ex.count(i+1)) dp[i+2]+=cnt;}cout<<re NL;return 0;}