답안 #387455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
387455	2021-04-08T12:30:44 Z	uacoder123	Group Photo (JOI21_ho_t3)	C++14	64 / 100	5000 ms	134800 KB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) lli(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <ii,lli> iii;
typedef vector <lli> vi;
typedef tree<lli,null_type,less<lli>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int n;
int h[5001],dp[5001][5001],p[5001],ans[5001];
int dp1[5001][5001];
int main()
{

      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
  cin>>n;
  for(int i=0;i<n;++i)
  {
    cin>>h[i];
    h[i]--;
    p[h[i]]=i;
  }
  for(int i=0;i<n;++i)
  {
    int v=0;
    for(int j=i-1;j>=0;--j)
    {
      if(p[j]<p[i])
        v=1;
      else
        v=0;
      dp1[i][j]=dp1[i][j+1]+v;
    }
  }
  for(int i=0;i<n;++i)
  {
    dp[i][i]=0;
    for(int j=i+1;j<n;++j)
      dp[i][j]=dp[i][j-1]+dp1[j][i];
  }
  for(int i=0;i<n;++i)
  {
    ordered_set s,e;
    int v1=0,v2;
  int ans1=n*n;

    for(int j=0;j<=i;++j)
      s.insert(p[j]);
    for(int j=i;j>=0;--j)
    {
      v1-=e.order_of_key(p[j]);
      e.insert(p[j]);
      s.erase(p[j]);
      v1+=s.size()-s.order_of_key(p[j]);
      if(j-1==-1)
        v2=0;
      else
        v2=ans[j-1];
      ans1=min(ans1,v1+dp[j][i]+v2);
    }
    ans[i]=ans1;
  }
  cout<<ans[n-1]<<endl;
  return 0;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	2 ms	492 KB	Output is correct
13	Correct	2 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	2 ms	492 KB	Output is correct
13	Correct	2 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	9 ms	2156 KB	Output is correct
22	Correct	9 ms	2156 KB	Output is correct
23	Correct	9 ms	2156 KB	Output is correct
24	Correct	9 ms	2156 KB	Output is correct
25	Correct	10 ms	2156 KB	Output is correct
26	Correct	11 ms	2156 KB	Output is correct
27	Correct	9 ms	2156 KB	Output is correct
28	Correct	9 ms	2156 KB	Output is correct
29	Correct	9 ms	2156 KB	Output is correct
30	Correct	9 ms	2156 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	2 ms	492 KB	Output is correct
13	Correct	2 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	9 ms	2156 KB	Output is correct
22	Correct	9 ms	2156 KB	Output is correct
23	Correct	9 ms	2156 KB	Output is correct
24	Correct	9 ms	2156 KB	Output is correct
25	Correct	10 ms	2156 KB	Output is correct
26	Correct	11 ms	2156 KB	Output is correct
27	Correct	9 ms	2156 KB	Output is correct
28	Correct	9 ms	2156 KB	Output is correct
29	Correct	9 ms	2156 KB	Output is correct
30	Correct	9 ms	2156 KB	Output is correct
31	Correct	160 ms	9380 KB	Output is correct
32	Correct	172 ms	9452 KB	Output is correct
33	Correct	159 ms	9324 KB	Output is correct
34	Correct	159 ms	9324 KB	Output is correct
35	Correct	160 ms	9452 KB	Output is correct
36	Correct	161 ms	9324 KB	Output is correct
37	Correct	157 ms	9324 KB	Output is correct
38	Correct	156 ms	9324 KB	Output is correct
39	Correct	158 ms	9324 KB	Output is correct
40	Correct	158 ms	9324 KB	Output is correct

Subtask #5
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	2 ms	492 KB	Output is correct
13	Correct	2 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	9 ms	2156 KB	Output is correct
22	Correct	9 ms	2156 KB	Output is correct
23	Correct	9 ms	2156 KB	Output is correct
24	Correct	9 ms	2156 KB	Output is correct
25	Correct	10 ms	2156 KB	Output is correct
26	Correct	11 ms	2156 KB	Output is correct
27	Correct	9 ms	2156 KB	Output is correct
28	Correct	9 ms	2156 KB	Output is correct
29	Correct	9 ms	2156 KB	Output is correct
30	Correct	9 ms	2156 KB	Output is correct
31	Correct	160 ms	9380 KB	Output is correct
32	Correct	172 ms	9452 KB	Output is correct
33	Correct	159 ms	9324 KB	Output is correct
34	Correct	159 ms	9324 KB	Output is correct
35	Correct	160 ms	9452 KB	Output is correct
36	Correct	161 ms	9324 KB	Output is correct
37	Correct	157 ms	9324 KB	Output is correct
38	Correct	156 ms	9324 KB	Output is correct
39	Correct	158 ms	9324 KB	Output is correct
40	Correct	158 ms	9324 KB	Output is correct
41	Execution timed out	5058 ms	134800 KB	Time limit exceeded
42	Halted	0 ms	0 KB	-

답안 #387455

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 36.0