oj.uz

Submission #896313

# Submission time Handle Problem Language Result Execution time Memory
896313 2024-01-01T08:59:58 Z joonwu04 Wiring (IOI17_wiring) C++17
0 / 100
 1000 ms 5920 KB 
#include "wiring.h"
#include <stdlib.h>
#include <algorithm>
#define MAX 100000000000000
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) {
//	printf("isStart");
  int n=r.size(), m=b.size();
  vector<int> a(n+m);
  for(int i=0, j=0; i<m || j<n;) 
    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 > 7) return false;
  }
  //printf("isEnd");
  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> r, std::vector<int> b) {
  	if (false && isSubtask1(r,b)) return subtask1(r,b);
  	if (false && isSubtask2(r,b)) return subtask2(r,b,0,r.size()-1,0,b.size()-1);
    else return subtask3(r,b);
//     else if (isSubtask4(r,b)) return subtask4(r,b);
//     else return fullTask(r,b);
    return 0;
}
 
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];
}
 
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 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;) {
        if (i==n) {a[i+j] = make_pair(j,1); j++;}
        else if (j==m) {a[i+j] = make_pair(i,0); i++;}
        else if (r[i]<b[j]) {a[i+j] = make_pair(i,0); i++;}
        else {a[i+j] = make_pair(j,1); j++;}
    }
 
    vector<long long> dp(n+m, MAX);
    dp[0] = MAX;
    int prev = 0, curr;
    for(curr=1; curr<n+m; curr++)
        if (a[curr].second != a[curr-1].second) break;
        else dp[curr] = MAX;
 
    if (a[0].second==0) 
        dp[curr] = subtask2(r,b,a[prev].first,a[curr-1].first,a[curr].first,a[curr].first);
    else 
        dp[curr] = subtask2(b,r,a[prev].first,a[curr-1].first,a[curr].first,a[curr].first);
 
 	//printf("curr=%d, dp[%d] = %lld\n", curr, curr, dp[curr]);
    int start = curr+1;
    for(int i=start; i<n+m; i++) {
        if (a[i].second != a[i-1].second) {prev = curr; curr = i;}
        for(int j =prev; j<curr; j++) {
        	if(j>=1 && dp[j-1] == MAX) continue;
        	
            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);
            
        	long long x = temp + (j==0 ? 0:dp[j-1]);
            if (dp[i]>x) dp[i] = x;    
			
			//printf("(i,j) = (%d, %d) : (%lld)\n", i, j, temp);  
        }
        //printf("dp[%d] = %lld\n", i, dp[i]);
    }
    return dp[n+m-1];
}

Compilation message

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

Subtask #1
0 / 7.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Execution timed out 1053 ms 4440 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 25 ms 5920 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '1152497305'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 1033 ms 5720 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

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