oj.uz

Submission #939154

# Submission time Handle Problem Language Result Execution time Memory
939154 2024-03-06T06:18:31 Z vjudge1 Building Bridges (CEOI17_building) C++17
30 / 100
 3000 ms 17240 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mod = 1e8 + 7, N = 1e6 + 100, inf = 1e9, mod2 = 1e9 + 7;

int dp[N];
int h[N], c[N];
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
	cout.tie(nullptr);
	memset(dp, 0x3f3f, sizeof(dp));
	int n;
	cin >> n;
	vector <int> pref(n + 2);
	for(int i = 1; i <= n; i++){
		cin >> h[i];
	}
	
	for(int i = 1; i <= n; i++){
		cin >> c[i];
		pref[i] = c[i] + pref[i - 1];
	}
	
	dp[1] = 0;
	
	for(int i = 2; i <= n; i++){
		for(int j = 1; j < i; j++){
			dp[i] = min(dp[i], (h[i] - h[j]) * (h[i] - h[j]) - pref[j] + pref[i - 1] + dp[j]);
		}
	}
	cout << dp[n];
}    
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

building.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | main(){
      | ^~~~
building.cpp: In function 'void fp(std::string)':
building.cpp:15:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
building.cpp:15:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 3 ms 11352 KB Output is correct
4 Correct 3 ms 11360 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3019 ms 17240 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 3 ms 11352 KB Output is correct
4 Correct 3 ms 11360 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Execution timed out 3019 ms 17240 KB Time limit exceeded
7 Halted 0 ms 0 KB -