oj.uz

Submission #896496

# Submission time Handle Problem Language Result Execution time Memory
896496 2024-01-01T14:49:55 Z nightfal Wiring (IOI17_wiring) C++14
30 / 100
 34 ms 6012 KB 
#include "wiring.h"
#include <cassert>
#include <cstdio>
#include <vector>
#include <climits>
#include <stdlib.h>
#include <algorithm>

using namespace std;
 
bool isSubtask1(std::vector<int> r, std::vector<int> b) {return r.size()<=200 && b.size()<=200;}
bool isSubtask2(std::vector<int> r, std::vector<int> b) {return r[r.size()-1]<b[0];}
bool isSubtask3(std::vector<int> r, std::vector<int> b) {
    int n=r.size(), m=b.size();
    vector<int> a(n+m);
   
    for(int i=0, j=0; i<n || j<m;)
        i==n? a[i+j++]=1: j==m? a[j+i++]=0: r[i]<b[j]? a[j+i++]=0:a[i+j++] = 1;

    int cnt = 1;
    for(int k=1; k<n+m; k++) {
        cnt = a[k]==a[k-1]? cnt+1:0;
        if (cnt > 6) return false;
    }
  return true;
}
 
long long subtask1(std::vector<int>, std::vector<int>);
long long subtask2(std::vector<int> &, std::vector<int> &, int, int, int, int);
long long subtask3(std::vector<int>, std::vector<int>);
long long min_total_length(std::vector<int>, std::vector<int> );


long long min_total_length(std::vector<int> r, std::vector<int> b) {
    // if (isSubtask4(r,b)) return subtask4(r,b);
    if (isSubtask3(r,b)) return subtask3(r,b);
  	else if (isSubtask2(r,b)) return subtask2(r,b,0,r.size()-1,0,b.size()-1);    
  	else if (isSubtask1(r,b)) return subtask1(r,b);
//     else return fullTask(r,b);
    return 0;
}
 
long long subtask3(std::vector<int> r, std::vector<int> b) {
    int n = r.size(), m = b.size();
    vector<pair<int,int>> a(n+m);
    
    for(int i=0, j=0; i<n || j<m;) // make_pair 내부에서 ++ 하면 안됨
        i==n? a[i+j++]=make_pair(j,1): j==m? a[j+i++]=make_pair(i,0): r[i]<b[j]? a[j+i++]=make_pair(i,0): a[i+j++]=make_pair(j,1);

    vector<long long> dp(n+m,LLONG_MAX);
    int prev=0, curr=0;
    for(curr=1; curr<n+m; curr++)
        if (a[curr].second != a[curr-1].second) break;

    for(int i=curr; i<n+m; i++) {
        for(int j =prev; j<curr; j++) {
            long long temp;
            if (a[prev].second==0)
                temp = subtask2(r,b,a[j].first,a[curr-1].first,a[curr].first,a[i].first);
            else
                temp = subtask2(b,r,a[j].first,a[curr-1].first,a[curr].first,a[i].first);
            
            if (j==0) {dp[i] = temp; break;}
            
            temp += min(dp[j-1],dp[j]);
            if (dp[i]>temp) dp[i] = temp;            
        }
        if (i<n+m-1 && a[i].second != a[i+1].second) {prev = curr; curr = i+1;}
    }
    return dp[n+m-1];
}

long long subtask2(std::vector<int> &arr1, std::vector<int> &arr2, int s1, int e1, int s2, int e2) {
  long long sum1=0, sum2=0, n = e1-s1+1, m=e2-s2+1;
  for(int i=s1; i<=e1; i++) sum1 += arr1[e1] - arr1[i];
  for(int i=s2; i<=e2; i++) sum2 += arr2[i] - arr2[s2];
  return sum1+sum2+max(n,m)*(arr2[s2]-arr1[e1]);
}

long long subtask1(std::vector<int> r, std::vector<int> b) {
	int n = r.size(), m = b.size();
    long long dp[n][m];
  	dp[0][0] = abs(r[0]-b[0]);
  	for(int i=1; i<n; i++) dp[i][0] = dp[i-1][0] + abs(r[i]-b[0]);
    for(int j=1; j<m; j++) dp[0][j] = dp[0][j-1] + abs(r[0]-b[j]);
  	for(int i=1; i<n; i++)  	
      for(int j=1; j<m; j++)
        dp[i][j] = min(min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]) + abs(r[i]-b[j]);

	return dp[n-1][m-1];
}

Compilation message

wiring.cpp: In function 'long long int subtask1(std::vector<int>, std::vector<int>)':
wiring.cpp:87:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   87 |       for(int j=1; j<m; j++)
      |       ^~~
wiring.cpp:90:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   90 |  return dp[n-1][m-1];
      |  ^~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 14 ms 2556 KB Output is correct
4 Correct 12 ms 2560 KB Output is correct
5 Correct 12 ms 2652 KB Output is correct
6 Correct 17 ms 3416 KB Output is correct
7 Correct 17 ms 3420 KB Output is correct
8 Correct 17 ms 3416 KB Output is correct
9 Correct 17 ms 3420 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 26 ms 5792 KB Output is correct
4 Correct 27 ms 5688 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 26 ms 5800 KB Output is correct
19 Correct 26 ms 5692 KB Output is correct
20 Correct 29 ms 5692 KB Output is correct
21 Correct 28 ms 5692 KB Output is correct
22 Correct 31 ms 5680 KB Output is correct
23 Correct 32 ms 6012 KB Output is correct
24 Correct 34 ms 5784 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 15 ms 3416 KB 3rd lines differ - on the 1st token, expected: '373710605', found: '0'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 14 ms 2556 KB Output is correct
20 Correct 12 ms 2560 KB Output is correct
21 Correct 12 ms 2652 KB Output is correct
22 Correct 17 ms 3416 KB Output is correct
23 Correct 17 ms 3420 KB Output is correct
24 Correct 17 ms 3416 KB Output is correct
25 Correct 17 ms 3420 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 26 ms 5792 KB Output is correct
29 Correct 27 ms 5688 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 360 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 26 ms 5800 KB Output is correct
44 Correct 26 ms 5692 KB Output is correct
45 Correct 29 ms 5692 KB Output is correct
46 Correct 28 ms 5692 KB Output is correct
47 Correct 31 ms 5680 KB Output is correct
48 Correct 32 ms 6012 KB Output is correct
49 Correct 34 ms 5784 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Incorrect 15 ms 3416 KB 3rd lines differ - on the 1st token, expected: '373710605', found: '0'
52 Halted 0 ms 0 KB -