oj.uz

답안 #90500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90500 2018-12-22T00:29:01 Z jasony123123 Kosta (COI14_kosta) C++11
20 / 100
 42 ms 11588 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"

typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */

#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}

const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const int INF = 1e8;
/****************************************************************/
/*
Find minimum D st K points with boxes of 2D sides cover all points
*/

struct BBox {
	int x1, y1, x2, y2;
	BBox() {
		x1 = INF, y1 = INF, x2 = -INF, y2 = -INF;
	}
	void upd(pii a) {
		minn(x1, a.first);
		maxx(x2, a.first);
		minn(y1, a.second);
		maxx(y2, a.second);
	}
};

const int MAXN = 200000;
int K, N;
pii pnts[MAXN];

void solve1() { 
	BBox b;
	FOR(i, 0, N) b.upd(pnts[i]);
	pii ans = { INF, -1 };
	FOR(i, 0, N) {
		int d = max(max(abs(b.x1 - pnts[i].first), abs(b.x2 - pnts[i].first)), max(abs(b.y1 - pnts[i].second), abs(b.y2 - pnts[i].second)));
		minn(ans, { d,i });
	}
	cout << ans.first << "\n" << ans.second + 1 << "\n";
}

void solve2() {
	cout << "Lol";
}

int main() {
	io();
	cin >> K >> N;
	FOR(i, 0, N) {
		int x, y;
		cin >> x >> y;
		pnts[i].first = x + y;
		pnts[i].second = x - y;
	}

	if (K == 1) solve1();
	else solve2();

	return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3448 KB Output is correct
2 Correct 26 ms 5264 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 8704 KB Output is correct
2 Correct 40 ms 11452 KB Output is correct

Subtask #5
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 11452 KB Expected integer, but "Lol" found

Subtask #6
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 11452 KB Expected integer, but "Lol" found

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 11452 KB Expected integer, but "Lol" found
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 11452 KB Expected integer, but "Lol" found
2 Halted 0 ms 0 KB -

Subtask #9
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 11452 KB Expected integer, but "Lol" found
2 Halted 0 ms 0 KB -

Subtask #10
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 11588 KB Expected integer, but "Lol" found
2 Halted 0 ms 0 KB -