oj.uz

Submission #893380

# Submission time Handle Problem Language Result Execution time Memory
893380 2023-12-27T03:40:51 Z vjudge1 Road Construction (JOI21_road_construction) C++17
11 / 100
 616 ms 22356 KB 
#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 N = 3e5 + 10, inf = 1e9;

int x[N], y[N];
int k;

main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	int n;
	cin >> n >> k;
	set <int> sty;
	for(int i = 1; i <= n; i++){
		cin >> x[i] >> y[i];
	}
	if(n <= 1000){
		vector <int> dists;
		for(int i = 1; i <= n; i++){
			for(int j = i + 1; j <= n; j++){
				dists.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
			}
		}
		sort(all(dists));
		for(int i = 0; i < k; i++){
			cout << dists[i] <<"\n";
		}
	}else{
		multiset <pair <int,int> > st;
		sort(x + 1, x + n + 1);
		for(int i = 1; i <= n - 1; i++){
			st.insert({x[i + 1] - x[i], i + 1});
		}
		while(k--){
			cout << st.begin() -> ff << endl;
			pair <int,int> f = *st.begin();
			st.erase(st.begin());
			if(f.ss == n)continue;
			st.insert({f.ff + x[f.ss + 1] - x[f.ss], f.ss + 1});
		}
		
	}
	//cout << endl;
}
/*
 * 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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9136 KB Output is correct
2 Correct 51 ms 9148 KB Output is correct
3 Correct 32 ms 7108 KB Output is correct
4 Correct 32 ms 7064 KB Output is correct
5 Correct 48 ms 7852 KB Output is correct
6 Correct 17 ms 6868 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 616 ms 21388 KB Output is correct
2 Correct 582 ms 21432 KB Output is correct
3 Correct 32 ms 6932 KB Output is correct
4 Correct 414 ms 21260 KB Output is correct
5 Correct 423 ms 22356 KB Output is correct
6 Correct 414 ms 21544 KB Output is correct
7 Correct 430 ms 21072 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 163 ms 20304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 163 ms 20304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9136 KB Output is correct
2 Correct 51 ms 9148 KB Output is correct
3 Correct 32 ms 7108 KB Output is correct
4 Correct 32 ms 7064 KB Output is correct
5 Correct 48 ms 7852 KB Output is correct
6 Correct 17 ms 6868 KB Output is correct
7 Incorrect 420 ms 12464 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9136 KB Output is correct
2 Correct 51 ms 9148 KB Output is correct
3 Correct 32 ms 7108 KB Output is correct
4 Correct 32 ms 7064 KB Output is correct
5 Correct 48 ms 7852 KB Output is correct
6 Correct 17 ms 6868 KB Output is correct
7 Correct 616 ms 21388 KB Output is correct
8 Correct 582 ms 21432 KB Output is correct
9 Correct 32 ms 6932 KB Output is correct
10 Correct 414 ms 21260 KB Output is correct
11 Correct 423 ms 22356 KB Output is correct
12 Correct 414 ms 21544 KB Output is correct
13 Correct 430 ms 21072 KB Output is correct
14 Incorrect 163 ms 20304 KB Output isn't correct
15 Halted 0 ms 0 KB -