oj.uz

답안 #893345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893345 2023-12-27T02:58:21 Z vjudge1 Road Construction (JOI21_road_construction) C++17
5 / 100
 1175 ms 2097152 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;
	for(int i = 1; i <= n; i++){
		cin >> x[i] >> y[i];
	}
	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";
	}
	//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

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 9164 KB Output is correct
2 Correct 52 ms 9144 KB Output is correct
3 Correct 32 ms 7124 KB Output is correct
4 Correct 32 ms 7120 KB Output is correct
5 Correct 49 ms 7880 KB Output is correct
6 Correct 21 ms 6868 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1175 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 997 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 997 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 9164 KB Output is correct
2 Correct 52 ms 9144 KB Output is correct
3 Correct 32 ms 7124 KB Output is correct
4 Correct 32 ms 7120 KB Output is correct
5 Correct 49 ms 7880 KB Output is correct
6 Correct 21 ms 6868 KB Output is correct
7 Runtime error 928 ms 2097152 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 9164 KB Output is correct
2 Correct 52 ms 9144 KB Output is correct
3 Correct 32 ms 7124 KB Output is correct
4 Correct 32 ms 7120 KB Output is correct
5 Correct 49 ms 7880 KB Output is correct
6 Correct 21 ms 6868 KB Output is correct
7 Runtime error 1175 ms 2097152 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -