Submission #293542

#	Time	Username	Problem	Language	Result	Execution time	Memory
293542		toloraia	Exercise Deadlines (CCO20_day1problem2)	C++14	25 / 25	118 ms	14976 KiB

Main

#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
//#define ll __int128
#define ll long long
#define int long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define y1 y122
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
/*
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")

#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")

#pragma comment(linker, "/STACK: 20000000005")
*/

using namespace std;

const int N = 200005;

int n, F[N];

void upd (int x){
    for (; x <= n; x += x & -x)
        F[x]++;
}

int dat (int x){
    int ans = 0;
    for (; x > 0; x &= x-1)
        ans += F[x];
    return ans;
}

int ans;
int a[N];
vector < int > V[N];

priority_queue < int > Q;

main()
{
    //freopen ("in.in", "r", stdin);freopen ("out.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        a[i] = n - a[i] + 1;
    }
    reverse (a+1, a+n+1);
    for (int i = 1; i <= n; i++)
        V[a[i]].pb (i);
    for (int i = 1; i <= n; i++){
        for (int x : V[i])
            Q.push (-x);
        if (Q.size() == 0){
            cout << -1 << endl;
            return 0;
        }
        int x = -Q.top();
        Q.pop();
        ans += dat (n) - dat (x);
        upd (x);
    }
    cout << ans << endl;
}

Compilation message (stderr)

Main.cpp:19:1: warning: "/*" within comment [-Wcomment]
   19 | /*
      |  
Main.cpp:55:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main()
      |      ^

• Subtask 1: 17 / 17
• Subtask 2: 8 / 8