제출 #1119858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1119858		modwwe	즐거운 채소 기르기 (JOI14_growing)	C++17	0 / 100	9 ms	7892 KiB

growing

#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]);
    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)
      |             ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 15
• Subtask 4: 0 / 55