oj.uz

Submission #682282

# Submission time Handle Problem Language Result Execution time Memory
682282 2023-01-16T05:44:04 Z armashka Road Construction (JOI21_road_construction) C++17
12 / 100
 1049 ms 9596 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
using namespace __gnu_pbds;
 
template<class T> using ordered_multiset =tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update> ;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define ft first
#define sd second
#define ll long long
#define pll pair<ll,ll>
const int N = 1e6 + 5;
const int M = 1e7 + 5;
const ll mod = 998244353;
const ll inf = 1e18;

ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x);x=binmul(x,x);ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }

ll n, k, x[N], y[N];
pll a[N];

const void solve() {
	cin >> n >> k;
	bool ok = 1;
	for (int i = 1; i <= n; ++ i) cin >> x[i] >> y[i], ok &= (y[i] == 0), a[i] = {x[i], y[i]};

	if (n <= 1000) {
	    vector <ll> v;
	    for (int i = 1; i < n; ++ i) {
	    	for (int j = i + 1; j <= n; ++ j) v.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
	    }
	    sort(all(v));            
	    for (int i = 0; i < k; ++ i) cout << v[i] << "\n";
		return;
	}

	if (k == 1) {     
		ll ans = inf;
		sort(a + 1, a + n + 1);
		for (int i = 1; i <= n; ++ i) x[i] = a[i].ft, y[i] = a[i].sd;
		for (ll i = 1; i < n; ++ i) {
			for (int j = i + 1; j <= min(n, i + 5000); ++ j) ans = min(ans, (abs(x[i] - x[j]) + abs(y[i] - y[j])));	
		}
	    cout << ans;

		return;
	}



}

int main() {
   	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	srand(time(NULL));

	ll tt = 1;
	//cin >> tt; 

	while (tt --) solve();

	return 0;
}

Compilation message

road_construction.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization("O3")
      | 
road_construction.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization("unroll-loops")
      | 
road_construction.cpp:7: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    7 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6988 KB Output is correct
2 Correct 58 ms 6988 KB Output is correct
3 Correct 40 ms 5084 KB Output is correct
4 Correct 40 ms 5156 KB Output is correct
5 Correct 55 ms 5816 KB Output is correct
6 Correct 20 ms 4556 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1035 ms 8156 KB Output is correct
2 Correct 1049 ms 8876 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1025 ms 8156 KB Output is correct
5 Correct 992 ms 8876 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1035 ms 8156 KB Output is correct
2 Correct 1049 ms 8876 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1025 ms 8156 KB Output is correct
5 Correct 992 ms 8876 KB Output is correct
6 Incorrect 76 ms 9596 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6988 KB Output is correct
2 Correct 58 ms 6988 KB Output is correct
3 Correct 40 ms 5084 KB Output is correct
4 Correct 40 ms 5156 KB Output is correct
5 Correct 55 ms 5816 KB Output is correct
6 Correct 20 ms 4556 KB Output is correct
7 Incorrect 21 ms 3404 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6988 KB Output is correct
2 Correct 58 ms 6988 KB Output is correct
3 Correct 40 ms 5084 KB Output is correct
4 Correct 40 ms 5156 KB Output is correct
5 Correct 55 ms 5816 KB Output is correct
6 Correct 20 ms 4556 KB Output is correct
7 Incorrect 41 ms 8140 KB Output isn't correct
8 Halted 0 ms 0 KB -