답안 #71889 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
71889	2018-08-25T18:42:01 Z	zetapi	전선 연결 (IOI17_wiring)	C++14	100 / 100	97 ms	76020 KB

wiring

//#include <wiring.h>
#include <bits/stdc++.h>
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 

typedef pair<ll,ll>  pii;

const ll MAX=3e5;
const ll INF=1e17;

vector<pii> vec,blocks;

ll arr[MAX],dp[MAX],Min[MAX],Max[MAX];

void relax(int idx)
{
   ll cur=0;
   for(int A=blocks[idx].second;A>=blocks[idx].first;A--)
   {
      cur+=arr[blocks[idx].second]-arr[A];
      Min[A]=min(dp[A],dp[A-1])+cur;
      Max[A]=min(dp[A],dp[A-1])+cur+(blocks[idx].second-A+1)*(arr[blocks[idx+1].first]-arr[blocks[idx].second]);
      assert(Min[A]>=0);
      assert(Max[A]>=0);
   }
   for(int A=blocks[idx].second-1;A>=blocks[idx].first;A--)
      Min[A]=min(Min[A],Min[A+1]);
   for(int A=blocks[idx].first+1;A<=blocks[idx].second;A++)
      Max[A]=min(Max[A],Max[A-1]);
   return ;
}

ll min_total_length(vector<int> r={1,2,3,7},vector<int> b={0,4,5,9,10}) 
{  
   for(int A=0;A<r.size();A++)
      vec.pb(mp(r[A],0));
   for(int A=0;A<b.size();A++)
      vec.pb(mp(b[A],1));
   sort(vec.begin(),vec.end());
   for(int A=0;A<vec.size();A++)
      arr[A+1]=vec[A].first;
   ll cur=0;
   for(int A=1;A<vec.size();A++)
   {
      if(vec[A].second!=vec[A-1].second)
      {
         blocks.pb(mp(cur+1,A-1+1));
         cur=A;
      }
   }
   blocks.pb(mp(cur+1,vec.size()-1+1));
   /*for(auto A:blocks)
      cout<<A.first<<" "<<A.second<<"\n";*/
   cur=0;
   for(int A=blocks[0].first;A<=blocks[0].second;A++)
   {
      dp[A]=INF;
      cur+=arr[blocks[0].second]-arr[A];
   }
   for(int A=blocks[1].first;A<=blocks[1].second;A++)
   {
      cur+=arr[A]-arr[blocks[1].first];
      dp[A]=cur+max(A-blocks[1].first+1,blocks[0].second-blocks[0].first+1)*(arr[blocks[1].first]-arr[blocks[0].second]);
   }
   for(int A=2;A<blocks.size();A++)
   {
      relax(A-1);
      cur=0;
      for(int B=blocks[A].first;B<=blocks[A].second;B++)
      {
         dp[B]=INF;
         cur+=arr[B]-arr[blocks[A].first];
         ll actual=B-blocks[A].first,C=blocks[A-1].second-actual;
         if(blocks[A-1].second-actual>=blocks[A-1].first)
         {
            dp[B]=min(dp[B],cur+Max[C]);
            dp[B]=min(dp[B],cur+Min[C]+(arr[blocks[A].first]-arr[blocks[A-1].second])*(actual+1));
         }
         else
            dp[B]=min(dp[B],cur+Min[blocks[A-1].first]+(arr[blocks[A].first]-arr[blocks[A-1].second])*(actual+1));
      }
   }
   return dp[vec.size()];
}

/*signed main()
{
   ios_base::sync_with_stdio(false);

   cout<<min_total_length();
   return 0;
}*/

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:39:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int A=0;A<r.size();A++)
                ~^~~~~~~~~
wiring.cpp:41:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int A=0;A<b.size();A++)
                ~^~~~~~~~~
wiring.cpp:44:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int A=0;A<vec.size();A++)
                ~^~~~~~~~~~~
wiring.cpp:47:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int A=1;A<vec.size();A++)
                ~^~~~~~~~~~~
wiring.cpp:69:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int A=2;A<blocks.size();A++)
                ~^~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	3 ms	544 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	3 ms	624 KB	Output is correct
9	Correct	2 ms	624 KB	Output is correct
10	Correct	3 ms	624 KB	Output is correct
11	Correct	2 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	3 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	696 KB	Output is correct
16	Correct	4 ms	696 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	696 KB	Output is correct
2	Correct	3 ms	696 KB	Output is correct
3	Correct	43 ms	6628 KB	Output is correct
4	Correct	55 ms	8236 KB	Output is correct
5	Correct	54 ms	9552 KB	Output is correct
6	Correct	59 ms	13452 KB	Output is correct
7	Correct	62 ms	15388 KB	Output is correct
8	Correct	60 ms	17360 KB	Output is correct
9	Correct	62 ms	19304 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	19304 KB	Output is correct
2	Correct	2 ms	19304 KB	Output is correct
3	Correct	86 ms	24252 KB	Output is correct
4	Correct	79 ms	24252 KB	Output is correct
5	Correct	4 ms	24252 KB	Output is correct
6	Correct	3 ms	24252 KB	Output is correct
7	Correct	2 ms	24252 KB	Output is correct
8	Correct	2 ms	24252 KB	Output is correct
9	Correct	2 ms	24252 KB	Output is correct
10	Correct	2 ms	24252 KB	Output is correct
11	Correct	2 ms	24252 KB	Output is correct
12	Correct	3 ms	24252 KB	Output is correct
13	Correct	4 ms	24252 KB	Output is correct
14	Correct	3 ms	24252 KB	Output is correct
15	Correct	2 ms	24252 KB	Output is correct
16	Correct	3 ms	24252 KB	Output is correct
17	Correct	3 ms	24252 KB	Output is correct
18	Correct	77 ms	24252 KB	Output is correct
19	Correct	73 ms	24252 KB	Output is correct
20	Correct	95 ms	24252 KB	Output is correct
21	Correct	95 ms	24268 KB	Output is correct
22	Correct	89 ms	24268 KB	Output is correct
23	Correct	90 ms	24268 KB	Output is correct
24	Correct	83 ms	24268 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	24268 KB	Output is correct
2	Correct	65 ms	24268 KB	Output is correct
3	Correct	74 ms	24268 KB	Output is correct
4	Correct	72 ms	24268 KB	Output is correct
5	Correct	78 ms	24268 KB	Output is correct
6	Correct	2 ms	24268 KB	Output is correct
7	Correct	3 ms	24268 KB	Output is correct
8	Correct	3 ms	24268 KB	Output is correct
9	Correct	3 ms	24268 KB	Output is correct
10	Correct	3 ms	24268 KB	Output is correct
11	Correct	3 ms	24268 KB	Output is correct
12	Correct	3 ms	24268 KB	Output is correct
13	Correct	3 ms	24268 KB	Output is correct
14	Correct	2 ms	24268 KB	Output is correct
15	Correct	3 ms	24268 KB	Output is correct
16	Correct	3 ms	24268 KB	Output is correct
17	Correct	2 ms	24268 KB	Output is correct
18	Correct	62 ms	24268 KB	Output is correct
19	Correct	59 ms	24268 KB	Output is correct
20	Correct	71 ms	24268 KB	Output is correct
21	Correct	61 ms	24268 KB	Output is correct
22	Correct	61 ms	24268 KB	Output is correct
23	Correct	71 ms	24268 KB	Output is correct
24	Correct	72 ms	24268 KB	Output is correct

Subtask #5
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	3 ms	544 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	3 ms	624 KB	Output is correct
9	Correct	2 ms	624 KB	Output is correct
10	Correct	3 ms	624 KB	Output is correct
11	Correct	2 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	3 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	696 KB	Output is correct
16	Correct	4 ms	696 KB	Output is correct
17	Correct	3 ms	696 KB	Output is correct
18	Correct	3 ms	696 KB	Output is correct
19	Correct	43 ms	6628 KB	Output is correct
20	Correct	55 ms	8236 KB	Output is correct
21	Correct	54 ms	9552 KB	Output is correct
22	Correct	59 ms	13452 KB	Output is correct
23	Correct	62 ms	15388 KB	Output is correct
24	Correct	60 ms	17360 KB	Output is correct
25	Correct	62 ms	19304 KB	Output is correct
26	Correct	3 ms	19304 KB	Output is correct
27	Correct	2 ms	19304 KB	Output is correct
28	Correct	86 ms	24252 KB	Output is correct
29	Correct	79 ms	24252 KB	Output is correct
30	Correct	4 ms	24252 KB	Output is correct
31	Correct	3 ms	24252 KB	Output is correct
32	Correct	2 ms	24252 KB	Output is correct
33	Correct	2 ms	24252 KB	Output is correct
34	Correct	2 ms	24252 KB	Output is correct
35	Correct	2 ms	24252 KB	Output is correct
36	Correct	2 ms	24252 KB	Output is correct
37	Correct	3 ms	24252 KB	Output is correct
38	Correct	4 ms	24252 KB	Output is correct
39	Correct	3 ms	24252 KB	Output is correct
40	Correct	2 ms	24252 KB	Output is correct
41	Correct	3 ms	24252 KB	Output is correct
42	Correct	3 ms	24252 KB	Output is correct
43	Correct	77 ms	24252 KB	Output is correct
44	Correct	73 ms	24252 KB	Output is correct
45	Correct	95 ms	24252 KB	Output is correct
46	Correct	95 ms	24268 KB	Output is correct
47	Correct	89 ms	24268 KB	Output is correct
48	Correct	90 ms	24268 KB	Output is correct
49	Correct	83 ms	24268 KB	Output is correct
50	Correct	2 ms	24268 KB	Output is correct
51	Correct	65 ms	24268 KB	Output is correct
52	Correct	74 ms	24268 KB	Output is correct
53	Correct	72 ms	24268 KB	Output is correct
54	Correct	78 ms	24268 KB	Output is correct
55	Correct	2 ms	24268 KB	Output is correct
56	Correct	3 ms	24268 KB	Output is correct
57	Correct	3 ms	24268 KB	Output is correct
58	Correct	3 ms	24268 KB	Output is correct
59	Correct	3 ms	24268 KB	Output is correct
60	Correct	3 ms	24268 KB	Output is correct
61	Correct	3 ms	24268 KB	Output is correct
62	Correct	3 ms	24268 KB	Output is correct
63	Correct	2 ms	24268 KB	Output is correct
64	Correct	3 ms	24268 KB	Output is correct
65	Correct	3 ms	24268 KB	Output is correct
66	Correct	2 ms	24268 KB	Output is correct
67	Correct	62 ms	24268 KB	Output is correct
68	Correct	59 ms	24268 KB	Output is correct
69	Correct	71 ms	24268 KB	Output is correct
70	Correct	61 ms	24268 KB	Output is correct
71	Correct	61 ms	24268 KB	Output is correct
72	Correct	71 ms	24268 KB	Output is correct
73	Correct	72 ms	24268 KB	Output is correct
74	Correct	64 ms	25556 KB	Output is correct
75	Correct	79 ms	27744 KB	Output is correct
76	Correct	88 ms	29452 KB	Output is correct
77	Correct	65 ms	31548 KB	Output is correct
78	Correct	65 ms	32440 KB	Output is correct
79	Correct	90 ms	34444 KB	Output is correct
80	Correct	61 ms	34768 KB	Output is correct
81	Correct	92 ms	35988 KB	Output is correct
82	Correct	72 ms	37172 KB	Output is correct
83	Correct	62 ms	38052 KB	Output is correct
84	Correct	70 ms	40012 KB	Output is correct
85	Correct	77 ms	43852 KB	Output is correct
86	Correct	70 ms	44632 KB	Output is correct
87	Correct	64 ms	46492 KB	Output is correct
88	Correct	66 ms	49168 KB	Output is correct
89	Correct	71 ms	51284 KB	Output is correct
90	Correct	85 ms	53304 KB	Output is correct
91	Correct	68 ms	54436 KB	Output is correct
92	Correct	69 ms	57192 KB	Output is correct
93	Correct	70 ms	58584 KB	Output is correct
94	Correct	71 ms	61336 KB	Output is correct
95	Correct	73 ms	63236 KB	Output is correct
96	Correct	70 ms	63772 KB	Output is correct
97	Correct	65 ms	66088 KB	Output is correct
98	Correct	87 ms	68220 KB	Output is correct
99	Correct	69 ms	70208 KB	Output is correct
100	Correct	82 ms	73180 KB	Output is correct
101	Correct	97 ms	73960 KB	Output is correct
102	Correct	90 ms	76020 KB	Output is correct

답안 #71889

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 13.0 / 13.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 45.0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
13.0 / 13.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
45.0 / 45.0