oj.uz

Submission #447826

# Submission time Handle Problem Language Result Execution time Memory
447826 2021-07-27T15:59:32 Z NhatMinh0208 Group Photo (JOI21_ho_t3) C++17
64 / 100
 5000 ms 772 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b;
ordered_set(int) lmao,lmao2;
int h[5001],hh[5001];
int dp[5001],ch[5001];
int main()
{
	fio;
    cin>>n;
    dp[n]=0;
    for (i=1;i<=n;i++) {cin>>hh[i]; h[hh[i]]=i;} 
    for (i=n-1;i>=0;i--)
    {
        dp[i]=1e9;
        for (j=i+1;j<=n;j++) lmao.insert(h[j]);
        lmao2.clear();
        u=0;
        for (j=i+1;j<=n;j++)
        {
            u+=lmao.order_of_key(h[j]);
            u-=lmao2.size();
            u+=2*lmao2.order_of_key(h[j]);
            lmao.erase(h[j]);
            lmao2.insert(h[j]);
            if (dp[j]+u<dp[i]) ch[i]=j;
            dp[i]=min(dp[i],dp[j]+u);
            
        }
        // cout<<i<<' '<<dp[i]<<' '<<ch[i]<<endl;
    }
    cout<<dp[0];
}

// a

Compilation message

Main.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 10 ms 344 KB Output is correct
22 Correct 12 ms 332 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 10 ms 332 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 10 ms 348 KB Output is correct
27 Correct 10 ms 332 KB Output is correct
28 Correct 10 ms 332 KB Output is correct
29 Correct 10 ms 332 KB Output is correct
30 Correct 10 ms 340 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 10 ms 344 KB Output is correct
22 Correct 12 ms 332 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 10 ms 332 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 10 ms 348 KB Output is correct
27 Correct 10 ms 332 KB Output is correct
28 Correct 10 ms 332 KB Output is correct
29 Correct 10 ms 332 KB Output is correct
30 Correct 10 ms 340 KB Output is correct
31 Correct 197 ms 516 KB Output is correct
32 Correct 197 ms 332 KB Output is correct
33 Correct 195 ms 380 KB Output is correct
34 Correct 205 ms 372 KB Output is correct
35 Correct 198 ms 360 KB Output is correct
36 Correct 193 ms 332 KB Output is correct
37 Correct 194 ms 364 KB Output is correct
38 Correct 204 ms 376 KB Output is correct
39 Correct 196 ms 380 KB Output is correct
40 Correct 198 ms 384 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 10 ms 344 KB Output is correct
22 Correct 12 ms 332 KB Output is correct
23 Correct 10 ms 348 KB Output is correct
24 Correct 10 ms 332 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 10 ms 348 KB Output is correct
27 Correct 10 ms 332 KB Output is correct
28 Correct 10 ms 332 KB Output is correct
29 Correct 10 ms 332 KB Output is correct
30 Correct 10 ms 340 KB Output is correct
31 Correct 197 ms 516 KB Output is correct
32 Correct 197 ms 332 KB Output is correct
33 Correct 195 ms 380 KB Output is correct
34 Correct 205 ms 372 KB Output is correct
35 Correct 198 ms 360 KB Output is correct
36 Correct 193 ms 332 KB Output is correct
37 Correct 194 ms 364 KB Output is correct
38 Correct 204 ms 376 KB Output is correct
39 Correct 196 ms 380 KB Output is correct
40 Correct 198 ms 384 KB Output is correct
41 Execution timed out 5049 ms 772 KB Time limit exceeded
42 Halted 0 ms 0 KB -