# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
966594 |
2024-04-20T06:14:15 Z |
Amr |
Wiring (IOI17_wiring) |
C++17 |
|
19 ms |
4952 KB |
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
#define sz size()
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int N = 2e5+2;
ll a[N];
long long min_total_length(std::vector<int> r, std::vector<int> b) {
ll n = r.sz, m = b.sz;
for(int i = 0; i < n; i++) a[r[i]] = 1;
for(int i = 0; i < m; i++) a[b[i]] = 0;
ll newlst = 0,start = 1,ans=0;
for(int i = 1; i <= m+n; i++)
{
if(i==m+n||a[i+1]!=a[i])
{
ll en = i;
ll lst = newlst; newlst = 0;
for(int j = start; j <= en; j++)
{
ll d1 = j-start , d2 = en-j;
if((start!=1)&&lst>0&&(d1<=d2||en==n+m))
{
lst--;
ans+=d1;
}
else if((start!=1)&&lst==0&&(d1<d2||en==n+m))
{
ans+=d1+1;
}
else
{
newlst++;
ans+=d2+1;
}
}
start = i+1;
}
}
return ans;
}
// cases
//not start! lst > 0 and (d1<d2 or end)
//else notstart! lst == 0 (d1+1<D2 or end)
//else newlst++;
//cases:
//d1<d2
//d1+1<d2
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '253' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
3rd lines differ - on the 1st token, expected: '904', found: '26' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
3rd lines differ - on the 1st token, expected: '316', found: '36' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
16 ms |
4672 KB |
Output is correct |
3 |
Correct |
17 ms |
4700 KB |
Output is correct |
4 |
Correct |
16 ms |
4696 KB |
Output is correct |
5 |
Correct |
17 ms |
4692 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
600 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
444 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
16 ms |
4700 KB |
Output is correct |
19 |
Correct |
16 ms |
4672 KB |
Output is correct |
20 |
Correct |
18 ms |
4792 KB |
Output is correct |
21 |
Correct |
18 ms |
4700 KB |
Output is correct |
22 |
Correct |
19 ms |
4952 KB |
Output is correct |
23 |
Correct |
17 ms |
4700 KB |
Output is correct |
24 |
Correct |
16 ms |
4700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '253' |
2 |
Halted |
0 ms |
0 KB |
- |