結果

問題 No.2462 七人カノン
ユーザー noya2noya2
提出日時 2023-09-08 21:51:09
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 90 ms / 2,000 ms
コード長 5,707 bytes
コンパイル時間 3,355 ms
コンパイル使用メモリ 258,824 KB
実行使用メモリ 6,452 KB
最終ジャッジ日時 2023-09-08 21:51:22
合計ジャッジ時間 11,275 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
5,244 KB
testcase_01 AC 3 ms
5,316 KB
testcase_02 AC 4 ms
5,284 KB
testcase_03 AC 5 ms
5,020 KB
testcase_04 AC 5 ms
5,092 KB
testcase_05 AC 5 ms
5,032 KB
testcase_06 AC 5 ms
5,132 KB
testcase_07 AC 4 ms
5,188 KB
testcase_08 AC 4 ms
5,148 KB
testcase_09 AC 5 ms
5,128 KB
testcase_10 AC 5 ms
5,036 KB
testcase_11 AC 5 ms
5,224 KB
testcase_12 AC 4 ms
5,080 KB
testcase_13 AC 76 ms
6,284 KB
testcase_14 AC 86 ms
6,064 KB
testcase_15 AC 76 ms
6,008 KB
testcase_16 AC 88 ms
6,452 KB
testcase_17 AC 90 ms
6,208 KB
testcase_18 AC 55 ms
5,704 KB
testcase_19 AC 56 ms
5,620 KB
testcase_20 AC 80 ms
6,356 KB
testcase_21 AC 80 ms
6,320 KB
testcase_22 AC 84 ms
6,356 KB
testcase_23 AC 80 ms
6,452 KB
testcase_24 AC 76 ms
5,680 KB
testcase_25 AC 90 ms
6,328 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

template<class E>
struct simple_graph {
    simple_graph (int n_ = 0, int m_ = -1) : n(n_), m(m_) {
        if (m == -1) m = n-1;
        es.resize(m);
        start.resize(m,0);
    }
    int n, m;
    void add_edge(int from, E e){
        static int id = 0;
        es[id] = e, start[id] = from;
        if (++id == m) build();
    }
    const auto operator[](int idx){ return std::ranges::subrange(es.begin()+start[idx],es.begin()+start[idx+1]); }
  private:
    void build(){
        vector<E> nes(m);
        vector<int> nstart(n+1,0);
        for (int i = 0; i < m; i++) nstart[start[i]+1]++;
        for (int i = 0; i < n; i++) nstart[i+1] += nstart[i];
        auto geta = nstart;
        for (int i = 0; i < m; i++) nes[geta[start[i]]++] = es[i];
        swap(nes,es); swap(nstart,start);
    }
    vector<E> es;
    vector<int> start;
};

void solve(){
    int n, q; in(n,q);
    const int mx = 100100;
    vector<int> imos(mx+1,0);
    simple_graph<pii> query(n,q);
    rep(i,q){
        int x, l, r; in(x,l,r);
        imos[l]++, imos[r]--;
        query.add_edge(x-1,pii(l,r));
    }
    rep(i,mx) imos[i+1] += imos[i];
    vector<ld> rui(mx+2); rui[0] = 0;
    rep(i,mx+1){
        rui[i+1] = rui[i];
        if (imos[i] != 0) rui[i+1] += ld(1)/imos[i];
    }
    rep(i,n){
        ld ans = 0;
        for (auto [l, r] : query[i]){
            ans += rui[r] - rui[l];
        }
        out(ans);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0