oj.uz

답안 #26622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26622 2017-07-03T13:25:25 Z model_code Plot (POI11_wyk) C++14
100 / 100
 19383 ms 8948 KB 
/*************************************************************************
 *                                                                       *
 *                    XVIII Olimpiada Informatyczna                      *
 *                                                                       *
 *   Zadanie:           Wykres                                           *
 *   Autor:             Jakub Wojtaszczyk                                *
 *   Opis:              Rozwiazanie wzorcowe                             *
 *                      (wieksza stala niz w wyk1.cpp)                   *
 *                                                                       *
 *************************************************************************/

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>

#define RMIN 0
#define RMAX 1420000

#define MXN 100000
#define MXM 100000
#define EPS 1e-10

using namespace std;

typedef long long LL;
typedef long double LD;

struct wsp_t {
	int x, y;
	wsp_t(int _x = 0, int _y = 0) : x(_x), y(_y) {}
};

struct fwsp_t {
	LD x, y;
};

inline LL sqr(int x) { return (LL)x*(LL)x; }

inline LD sqrl(LD x) {return x * x;}

inline LL get_ilwek(const wsp_t &o, const wsp_t &p) {
	return (LL)o.x * (LL)p.y - (LL)o.y * (LL)p.x;
}

inline LL get_ilskal(const wsp_t &o, const wsp_t &p) {
	return (LL)o.x * (LL)p.x + (LL)o.y * (LL)p.y;
}

inline wsp_t wek(const wsp_t &o, const wsp_t &p) {
	return wsp_t(p.x-o.x, p.y-o.y);
}

inline LL get_dist2(const wsp_t &o, const wsp_t &p) {
	return sqr(o.x-p.x) + sqr(o.y-p.y);
}

inline LD get_dist(const wsp_t &o, const wsp_t &p) {
	return sqrt((LD)get_dist2(o, p));
}

inline bool fits(const wsp_t *p, LD x, LD y, LD r) {
	x -= p->x; y -= p->y;
	LD dist2 = x*x + y*y;
	return dist2 <= (r+EPS) * (r+EPS);
}

wsp_t *tmp[MXN];

void random_permutate(int n) {
	for (int i = 1; i < n; ++i) {
		swap(tmp[i], tmp[rand() % (i+1)]);
	}
}

inline LD get_square(const wsp_t &p) {
  return (LD) (sqr(p.x) + sqr(p.y));
}

void recompute_with_three (int k, int l, int m, LD &x, LD &y, LD &r) {
  LD mian = (LD) tmp[k]->x * (LD) tmp[l]->y - (LD) tmp[k]->y * (LD) tmp[l]->x +
            (LD) tmp[l]->x * (LD) tmp[m]->y - (LD) tmp[l]->y * (LD) tmp[m]->x +
            (LD) tmp[m]->x * (LD) tmp[k]->y - (LD) tmp[m]->y * (LD) tmp[k]->x;
  mian *= 2.;
  x = get_square(*tmp[k]) * (LD) (tmp[m]->y - tmp[l]->y) +
      get_square(*tmp[l]) * (LD) (tmp[k]->y - tmp[m]->y) + 
      get_square(*tmp[m]) * (LD) (tmp[l]->y - tmp[k]->y);
  y = get_square(*tmp[k]) * (LD) (tmp[m]->x - tmp[l]->x) +
      get_square(*tmp[l]) * (LD) (tmp[k]->x - tmp[m]->x) + 
      get_square(*tmp[m]) * (LD) (tmp[l]->x - tmp[k]->x);
  x /= -mian; y /= mian;
  r = sqrt(sqrl(x - (LD) tmp[k]->x) + sqrl(y - (LD) tmp[k]->y));
}

void recompute_with_two (int k, int l, LD &x, LD &y, LD &r) {
  random_permutate(k-1);
  x = (tmp[k]->x + tmp[l]->x) / 2.;
  y = (tmp[k]->y + tmp[l]->y) / 2.;
  r = get_dist(*tmp[k], *tmp[l]) / 2.;
  for (int i = 0; i < k; i++) {
    if (!fits(tmp[i], x, y, r)) {
      recompute_with_three(k, l, i, x, y, r);
    }
  }
}

void recompute_with_point (int k, LD &x, LD &y, LD &r) {
  random_permutate(k-1);
  x = tmp[k]->x; y = tmp[k]->y; r = 0.;
  for (int i = 0; i < k; i++) {
    if (!fits(tmp[i], x, y, r)) {
      recompute_with_two (i, k, x, y, r);
    }
  }
}

wsp_t wsp[MXN];

bool can_hold(int pc, int kn, LD r, fwsp_t &mid) {
	for (int i = pc; i <= kn; ++i) {
		tmp[i-pc] = &wsp[i];
	}
	random_permutate(kn-pc+1);
	LD x = tmp[0]->x, y = tmp[0]->y, cr = 0.;
	for (int i = 1; i <= kn-pc; ++i) {
		if (!fits(tmp[i], x, y, cr)) {
			recompute_with_point(i, x, y, cr);
// DBG
			if (cr > RMAX) {
			  for (int i = 0; i < kn-pc+1; i++) {
			    printf("%d %d\n", tmp[i]->x, tmp[i]->y);
			  }
			  printf("(%Lf %Lf) %Lf\n", x, y,cr);
			  exit(0);
			}
			if (cr > r) {
				return false;
			}
		}
	}
	mid.x = x; mid.y = y;
	return true;
}

int n;

void check(int &pos, LD r, fwsp_t &mid) {
	int count = 1;
	mid.x = wsp[pos].x;
	mid.y = wsp[pos].y;
	while (pos + count < n && can_hold(pos, pos + count, r, mid)) {
		count *= 2;
	}
	int pc = pos + count / 2;
	int kn = min(pos + count, n);
	while (pc + 1 < kn) {
		int sr = (pc + kn) / 2;
		if (can_hold(pos, sr, r, mid)) {
			pc = sr;
		} else {
			kn = sr;
		}
	}
	pos = kn;
}

fwsp_t mid[MXM], midsol[MXM];
int m, s, ssol;

int main() {
	LD rmin = RMIN;
	LD rmax = RMAX;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; ++i) {
		scanf("%d%d", &wsp[i].x, &wsp[i].y);
	}
	ssol = -1;
	while (rmin + EPS < rmax) {
		LD r = (rmin + rmax) / 2.;
		int cnt = 0;
		for (s = 0; s < m && cnt < n; ++s) {
			check(cnt, r, mid[s]);
		}
		if (cnt == n) {
			ssol = s;
			copy(mid, mid+s, midsol);
			rmax = r;
		} else {
			rmin = r;
		}
	}
	assert(ssol != -1);
	assert(ssol <= m);
	printf("%.8Lf\n%d\n", rmax, ssol);
	for (int i = 0; i < ssol; ++i) {
		printf("%.8Lf %.8Lf\n", midsol[i].x, midsol[i].y);
	}
	return 0;
}

Compilation message

wyk.cpp: In function 'int main()':
wyk.cpp:174:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
wyk.cpp:176:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &wsp[i].x, &wsp[i].y);
                                      ^

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
7.0 / 7.0

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

Subtask #5
8.0 / 8.0

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

Subtask #6
8.0 / 8.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 313 ms 8948 KB Output is correct
2 Correct 326 ms 8948 KB Output is correct
3 Correct 196 ms 8948 KB Output is correct

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9166 ms 8948 KB Output is correct
2 Correct 9836 ms 8948 KB Output is correct
3 Correct 819 ms 8948 KB Output is correct

Subtask #12
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18793 ms 8948 KB Output is correct
2 Correct 19383 ms 8948 KB Output is correct
3 Correct 8916 ms 8948 KB Output is correct
4 Correct 17523 ms 8948 KB Output is correct

Subtask #13
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2583 ms 8948 KB Output is correct
2 Correct 1146 ms 8948 KB Output is correct
3 Correct 13033 ms 8948 KB Output is correct