結果
| 問題 | No.1079 まお |
| ユーザー |
 akua
|
| 提出日時 | 2023-08-23 17:42:55 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,174 bytes |
| コンパイル時間 | 4,608 ms |
| コンパイル使用メモリ | 202,960 KB |
| 実行使用メモリ | 50,156 KB |
| 最終ジャッジ日時 | 2024-12-22 00:45:55 |
| 合計ジャッジ時間 | 19,124 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 3 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,820 KB |
| testcase_02 | AC | 2 ms
6,816 KB |
| testcase_03 | AC | 2 ms
6,816 KB |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | AC | 915 ms
48,876 KB |
| testcase_23 | AC | 861 ms
50,124 KB |
| testcase_24 | AC | 889 ms
50,156 KB |
| testcase_25 | AC | 926 ms
50,068 KB |
| testcase_26 | AC | 928 ms
50,148 KB |
| testcase_27 | AC | 180 ms
10,116 KB |
| testcase_28 | WA | - |
| testcase_29 | AC | 381 ms
31,876 KB |
| testcase_30 | AC | 393 ms
31,748 KB |
| testcase_31 | AC | 192 ms
10,496 KB |
ソースコード
#include<atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
#include<unordered_map>
#include <random>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
//#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define arr(x) (x).rbegin(),(x).rend()
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;
//const int inf=1e7;
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
if(n==0) return 1;
x%=mod;
ll res=pow_pow(x*x%mod,n/2,mod);
if(n&1)res=res*x%mod;
return res;
}
ll gcdll(ll x,ll y){
if(y==0)return x;
return gcdll(y,x%y);
}
//ll INFF=1000100100100100100;
ll lcmll(ll x,ll y){
ll X=(x/gcdll(x,y)),Y=y;
return X*Y;
}
template<class T> bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
else return false;
}
template<class T> bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
else return false;
}
struct edge{
int to; ll cost;int dir;
edge(int to,ll cost,int dir) : to(to),cost(cost),dir(dir){}
};
using ve=vector<edge>;
using vve=vector<ve>;
//using mint = modint998244353;
using mint = modint1000000007;
using vm=vector<mint>;
using vvm=vector<vm>;
//const int mod = 998244353;
int mod = 1e9+7;
constexpr ll MAX = 401000;
ll fact[MAX],finv[MAX],inv[MAX];
void initcomb(){
fact[0]=fact[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2;i<MAX;i++){
fact[i]=fact[i-1]*i%mod;
inv[i]=mod-inv[mod%i]*(mod/i)%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
}
ll comb(ll n,ll k){
if(n<k) return 0;
if(n<0||k<0) return 0;
return fact[n]*(finv[k]*finv[n-k]%mod)%mod;
}
struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x == y) return false;
//if (siz[x] < siz[y]) swap(x, y);
par[y] = x;
siz[x] += siz[y];
return true;
}
int size(int x) {
return siz[root(x)];
}
};
struct Compress{
vll a;
map<ll,ll> d,d2;
int cnt;
Compress() :cnt(0) {}
void add(ll x){a.push_back(x);}
void init(){
set<ll>s(a.begin(),a.end());
for(auto y:s)d[y]=cnt++;
for(auto&y:a)y=d[y];
for(auto u:d)d2[u.second]=u.first;
}
ll to(ll x){return d[x];} //変換先
ll from(ll x){return d2[x];}//逆引き
int size(){return cnt;}
};
using S=ll;
S op(S a,S b){return min(a,b);}
S e(){return inf;}
vll anss;
void solve(int test){
int n,k; cin >> n >> k;
Compress comp;
vll a(n);rep(i,n)cin >> a[i];
vi l(n),r(n);
rep(i,n)comp.add(a[i]),comp.add(k-a[i]);
comp.init();
int si=comp.size();
vvll g(si);
vvll rui(si);
rep(i,n)g[comp.to(a[i])].push_back(i);
rep(i,si)if(g[i].size()){
rui[i].resize(g[i].size());
rui[i][0]=g[i][0];
repi(j,1,g[i].size())rui[i][j]=rui[i][j-1]+g[i][j];
}
{
segtree<S,op,e> seg(a);
rep(i,n){
{
int ac=i,wa=-1;
while(ac-wa>1){
int wj=(wa+ac)/2;
if(seg.prod(wj,i)>a[i])ac=wj;
else wa=wj;
}
l[i]=ac;
}
{
int ac=i,wa=n;
while(wa-ac>1){
int wj=(wa+ac)/2;
if(seg.prod(i+1,wj+1)>a[i])ac=wj;
else wa=wj;
}
r[i]=ac;
}
}
}
ll ans=0;
rep(i,n){
if(i-l[i]+1<=r[i]-i+1){
repi(j,l[i],i+1){
//debug(j);
int nk=comp.to(k-a[j]);
int index=lower_bound(all(g[nk]),i)-g[nk].begin();
int index2=lower_bound(all(g[nk]),r[i]+1)-g[nk].begin();
index2--;
if(index==g[nk].size() || index>index2)continue;
ans-=1ll*(index-index2+1)*(j-1);
ans+=rui[nk][index2];
if(index-1>=0)ans-=rui[nk][index-1];
}
}
else {
repi(j,i,r[i]+1){
int nk=comp.to(k-a[j]);
int index=lower_bound(all(g[nk]),l[i])-g[nk].begin();
int index2=lower_bound(all(g[nk]),i+1)-g[nk].begin();
index2--;
if(index==g[nk].size() || index>index2)continue;
ans+=1ll*(index-index2+1)*(j+1);
ans-=rui[nk][index2];
if(index-1>=0)ans+=rui[nk][index-1];
}
}
}
cout << ans << endl;
}
//g++ main.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
int t=1;//cin >>t;
rep(test,t)solve(test);
for(auto ans:anss)cout << ans << endl;
}