oj.uz

답안 #427301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427301 2021-06-14T14:07:10 Z farhan132 Group Photo (JOI21_ho_t3) C++17
100 / 100
 4529 ms 840 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>



using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll) 998244353;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

bool USACO = 0;

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,less<ll >, rb_tree_tag,tree_order_statistics_node_update>

const ll N = 5005;

ll dp[N] , a[N] , p[N];

void solve(){

   dp[0] = 0;
   ll n;
   cin >> n;
   for(ll i = 1; i <= n; i++) cin >> a[i] , dp[i] = INF;

   for(ll i = 1; i <= n; i++){
    vector < ll > v;
    for(ll j = 1; j <= n; j++){
      if(a[j] >= i) p[a[j]] = v.size() , v.pb(a[j]);
    }
    ordered_set s;
    ll ans = dp[i - 1]; 
    for(ll j = i; j <= n; j++){
      s.in(p[j]);
      ll sz = s.size();
      sz = sz - (s.order_of_key(p[j])) - 1;
      ans += p[j] - sz;
      dp[j] = min(dp[j] , ans);
    }
   }
   cout << dp[n];

   return;
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
    #else 
      if(USACO){
        freopen("balancing.in", "r", stdin);
        freopen("balancing.out", "w", stdout);
      }else{
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
      }
    #endif
    ll T = 1;
    //cin >> T;
    ll CT = 0;
    while(T--){
      //  cout << "Case #" << ++CT <<": " ;
        solve();
    }
 
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:111:8: warning: unused variable 'CT' [-Wunused-variable]
  111 |     ll CT = 0;
      |        ^~
Main.cpp:103:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |         freopen("balancing.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:104:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |         freopen("balancing.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 328 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 204 KB Output is correct
13 Correct 1 ms 328 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 332 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 328 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 204 KB Output is correct
13 Correct 1 ms 328 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 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 8 ms 332 KB Output is correct
24 Correct 5 ms 332 KB Output is correct
25 Correct 7 ms 352 KB Output is correct
26 Correct 5 ms 328 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
28 Correct 5 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 5 ms 332 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 328 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 204 KB Output is correct
13 Correct 1 ms 328 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 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 8 ms 332 KB Output is correct
24 Correct 5 ms 332 KB Output is correct
25 Correct 7 ms 352 KB Output is correct
26 Correct 5 ms 328 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
28 Correct 5 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 5 ms 332 KB Output is correct
31 Correct 84 ms 392 KB Output is correct
32 Correct 83 ms 332 KB Output is correct
33 Correct 102 ms 396 KB Output is correct
34 Correct 121 ms 396 KB Output is correct
35 Correct 84 ms 392 KB Output is correct
36 Correct 115 ms 392 KB Output is correct
37 Correct 108 ms 392 KB Output is correct
38 Correct 94 ms 396 KB Output is correct
39 Correct 94 ms 332 KB Output is correct
40 Correct 94 ms 332 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 328 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 204 KB Output is correct
13 Correct 1 ms 328 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 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 8 ms 332 KB Output is correct
24 Correct 5 ms 332 KB Output is correct
25 Correct 7 ms 352 KB Output is correct
26 Correct 5 ms 328 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
28 Correct 5 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 5 ms 332 KB Output is correct
31 Correct 84 ms 392 KB Output is correct
32 Correct 83 ms 332 KB Output is correct
33 Correct 102 ms 396 KB Output is correct
34 Correct 121 ms 396 KB Output is correct
35 Correct 84 ms 392 KB Output is correct
36 Correct 115 ms 392 KB Output is correct
37 Correct 108 ms 392 KB Output is correct
38 Correct 94 ms 396 KB Output is correct
39 Correct 94 ms 332 KB Output is correct
40 Correct 94 ms 332 KB Output is correct
41 Correct 4513 ms 824 KB Output is correct
42 Correct 4437 ms 816 KB Output is correct
43 Correct 4518 ms 824 KB Output is correct
44 Correct 4360 ms 824 KB Output is correct
45 Correct 4370 ms 820 KB Output is correct
46 Correct 4282 ms 840 KB Output is correct
47 Correct 4385 ms 832 KB Output is correct
48 Correct 4237 ms 816 KB Output is correct
49 Correct 4162 ms 820 KB Output is correct
50 Correct 4457 ms 824 KB Output is correct
51 Correct 4298 ms 820 KB Output is correct
52 Correct 4529 ms 820 KB Output is correct
53 Correct 4455 ms 824 KB Output is correct
54 Correct 4467 ms 824 KB Output is correct
55 Correct 4297 ms 840 KB Output is correct