結果

問題 No.2154 あさかつの参加人数
ユーザー a16784542a16784542
提出日時 2022-12-09 21:41:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 926 ms / 2,000 ms
コード長 3,464 bytes
コンパイル時間 4,575 ms
コンパイル使用メモリ 260,756 KB
実行使用メモリ 7,212 KB
最終ジャッジ日時 2023-08-04 23:03:21
合計ジャッジ時間 23,875 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 923 ms
7,084 KB
testcase_01 AC 924 ms
6,960 KB
testcase_02 AC 898 ms
6,916 KB
testcase_03 AC 925 ms
7,212 KB
testcase_04 AC 926 ms
6,996 KB
testcase_05 AC 157 ms
4,376 KB
testcase_06 AC 496 ms
4,692 KB
testcase_07 AC 526 ms
5,392 KB
testcase_08 AC 581 ms
6,216 KB
testcase_09 AC 349 ms
5,260 KB
testcase_10 AC 478 ms
5,548 KB
testcase_11 AC 785 ms
6,492 KB
testcase_12 AC 571 ms
5,392 KB
testcase_13 AC 259 ms
4,376 KB
testcase_14 AC 557 ms
5,424 KB
testcase_15 AC 536 ms
5,940 KB
testcase_16 AC 600 ms
5,756 KB
testcase_17 AC 575 ms
5,140 KB
testcase_18 AC 719 ms
6,160 KB
testcase_19 AC 75 ms
4,376 KB
testcase_20 AC 669 ms
6,028 KB
testcase_21 AC 296 ms
4,996 KB
testcase_22 AC 589 ms
6,700 KB
testcase_23 AC 691 ms
6,228 KB
testcase_24 AC 778 ms
6,560 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#if !__INCLUDE_LEVEL__

#include __FILE__

struct Solver {
void solve() {
  int n,m;cin>>n>>m;
  V<int> a(n+1);
  rep(i,m){
    int l,r;cin>>l>>r;
    a[r-1]++;
    a[l]--;
  }
  rep(i,n)a[i+1]+=a[i];
  reverse(all(a));
  rep(i,1,n+1){
    cout<<a[i]<<endl;
  }
}};

signed main() {
  int ts = 1;
  // scanf("%lld",&ts);
  rep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

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 (b<a) { a=b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}

const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;


#endif

0