이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf = 1e9;
const ll mod2 = 1e9 + 7;
const int mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
if(x+y<0)x+=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c;
};
struct id
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r ;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
// modwwe
phongbeo();
// checktime
}
int a[300001];
vector<int> v;
int lef[300001];
int rig[300001];
struct fen
{
int bit[300001];
void upd(int x)
{
for(x; x; x-=x&-x)
bit[x]++;
}
int get(int x)
{
int s=0;
for(x; x<=n; x+=x&-x)
s+=bit[x];
return s;
}
} fen;
void phongbeo()
{
cin>>n;
for(int i=1; i<=n; i++)
cin>>a[i],v.pb(a[i]);
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
for(int i=1; i<=n; i++)
a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin()+1;
for(int i=1; i<=n; i++)
{
lef[i]=fen.get(a[i]+1);
fen.upd(a[i]);
}
for(int i=1; i<=n; i++)
fen.bit[i]=0;
for(int i=n; i>=1; --i)
{
rig[i]=fen.get(a[i]+1);
fen.upd(a[i]);
}
s4=0;
for(int i=1; i<=n; i++){
s4=s4+min(lef[i],rig[i]);}
cout<<s4;
}
컴파일 시 표준 에러 (stderr) 메시지
growing.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
75 | main()
| ^~~~
growing.cpp: In member function 'void fen::upd(long long int)':
growing.cpp:97:13: warning: statement has no effect [-Wunused-value]
97 | for(x; x; x-=x&-x)
| ^
growing.cpp: In member function 'long long int fen::get(long long int)':
growing.cpp:103:13: warning: statement has no effect [-Wunused-value]
103 | for(x; x<=n; x+=x&-x)
| ^
growing.cpp: In function 'void phongbeo()':
growing.cpp:111:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
111 | for(int i=1; i<=n; i++)
| ^~~
growing.cpp:113:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
113 | sort(v.begin(),v.end());
| ^~~~
growing.cpp: In function 'int main()':
growing.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | #define fin(x) freopen(x".inp","r",stdin)
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
growing.cpp:79:13: note: in expansion of macro 'fin'
79 | fin(task);
| ^~~
growing.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
14 | #define fou(x) freopen(x".out","w",stdout)
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~
growing.cpp:80:12: note: in expansion of macro 'fou'
80 | fou(task);
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |