제출 #867276

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
867276		Sir_Ahmed_Imran	Nuclearia (CEOI15_nuclearia)	C++17	0 / 100	1071 ms	22556 KiB

nuclearia

                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define li long int
#define ld long double
#define append push_back
#define add insert
#define nl "\n"
#define ff first
#define ss second
#define pii pair<int,int>
#define pic pair<int,char>
#define all(x) (x).begin(),(x).end()
#define sum(a) accumulate(all(a),0)
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL)
#define terminator main
#define MAXN 2500001
int n,m;
void solve1(){
    ld x,y;
    ll a[n+1];
    int o,p,q,r,s,t;
    cin>>o;
    while(o--){
        cin>>p>>q>>r>>s;
        for(int i=1;i<=n;i++){
            t=i;
            q=abs(p-i);
            q=max(0,r-q*s);
            while(t<=n){
                a[t]+=q;
                t+=t&(-t);
            }
        }
    }
    cin>>o;
    while(o--){
        cin>>p>>r>>q>>s;
        x=0;
        y=(q-p+1);
        while(q){
            x+=a[q];
            q-=q&(-q);
        }
        p--;
        while(p){
            x-=a[p];
            p-=p&(-p);
        }
        cout<<round(x/y)<<nl;
    }
}
void solve2(){

}
void solve(){
    cin>>n>>m;
    if(m==1) solve1();
    else solve2();
}
int terminator(){
    L0TA;
    solve();
    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 2
• Subtask 3: 0 / 3
• Subtask 4: 0 / 2
• Subtask 5: 0 / 6
• Subtask 6: 0 / 4
• Subtask 7: 0 / 6
• Subtask 8: 0 / 4
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10
• Subtask 11: 0 / 15
• Subtask 12: 0 / 10
• Subtask 13: 0 / 12
• Subtask 14: 0 / 8