Submission #52765

# Submission time Handle Problem Language Result Execution time Memory
52765 2018-06-26T17:07:24 Z KieranHorgan Wiring (IOI17_wiring) C++17
13 / 100
168 ms 22836 KB
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long

int n, m, ans;
vector<int> fullList;
unordered_map<int, bool> isRed, isBlue;
vector<vector<int>> segments;
vector<vector<int>> prefixR;
vector<vector<int>> prefixL;

int calcWire(int s, int l, int r) {
	int res = 0;
	res += prefixL[s][l];
	res += (segments[s].size()-l) * (segments[s+1][0]-segments[s].back());
	res += prefixR[s+1][r];
	res += (r+1) * (segments[s+1][0]-segments[s].back());
	res -= min((int)segments[s].size()-l, r+1)*(segments[s+1][0]-segments[s].back());
	return res;
}

long long min_total_length(vector<signed> r, vector<signed> b) {
	n = r.size();
	m = b.size();
	fullList.resize(n+m);
	merge(r.begin(), r.end(), b.begin(), b.end(), fullList.begin());
	for(auto x: r)
		isRed[x]=1;
	for(auto x: b)
		isBlue[x]=1;

	for(int i = 0; i < m+n; i++) {
		if(i==0 || isRed[fullList[i]] != isRed[fullList[i-1]]) {
			segments.push_back(vector<int>(0));
			prefixL.push_back(vector<int>(0));
			prefixR.push_back(vector<int>(0));
			segments.back().push_back(fullList[i]);
		} else {
			segments.back().push_back(fullList[i]);
		}
	}

	for(int s = 0; s < segments.size(); s++) {
		prefixR[s].push_back(0);
		for(int i = 1; i < segments[s].size(); i++)
			prefixR[s].push_back(prefixR[s][i-1]+segments[s][i]-segments[s][0]);
		reverse(segments[s].begin(), segments[s].end());
		prefixL[s].push_back(0);
		for(int i = 1; i < segments[s].size(); i++)
			prefixL[s].push_back(prefixL[s][i-1]+segments[s][0]-segments[s][i]);
		reverse(prefixL[s].begin(), prefixL[s].end());
		reverse(segments[s].begin(), segments[s].end());
	}

//	for(int s = 0; s < segments.size(); s++) {
//		cerr << s << ":\n";
//		for(int i = 0; i < segments[s].size(); i++)
//			cerr << segments[s][i] << " "; cerr << endl;
//		for(int i = 0; i < prefixL[s].size(); i++)
//			cerr << prefixL[s][i] << " "; cerr << endl;
//		for(int i = 0; i < prefixR[s].size(); i++)
//			cerr << prefixR[s][i] << " "; cerr << endl;
//	}

	if(segments.size() == 2)
		return calcWire(0, 0, m-1);
	return -1;
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:44:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int s = 0; s < segments.size(); s++) {
                 ~~^~~~~~~~~~~~~~~~~
wiring.cpp:46:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < segments[s].size(); i++)
                  ~~^~~~~~~~~~~~~~~~~~~~
wiring.cpp:50:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < segments[s].size(); i++)
                  ~~^~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB 3rd lines differ - on the 1st token, expected: '25859', found: '-1'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 500 KB Output is correct
2 Correct 2 ms 552 KB Output is correct
3 Correct 99 ms 16736 KB Output is correct
4 Correct 105 ms 16984 KB Output is correct
5 Correct 108 ms 19240 KB Output is correct
6 Correct 133 ms 22748 KB Output is correct
7 Correct 154 ms 22804 KB Output is correct
8 Correct 135 ms 22804 KB Output is correct
9 Correct 168 ms 22836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 22836 KB Output is correct
2 Incorrect 2 ms 22836 KB 3rd lines differ - on the 1st token, expected: '17703', found: '-1'
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 22836 KB 3rd lines differ - on the 1st token, expected: '27', found: '-1'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB 3rd lines differ - on the 1st token, expected: '25859', found: '-1'
2 Halted 0 ms 0 KB -