Submission #224961

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
224961	2020-04-19T07:11:55 Z	NONAME	Konj (COCI19_konj)	C++17	70 / 70	68 ms	5240 KB

konj

#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 2 * 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

int n, pr[N], x1[N], x2[N], yy1[N], y2[N], fx, x[400][400], sx, sy, lftx, lfty, rghx, rghy;
char rs[400][400];

int f(int x) { return (x == pr[x]) ? x : pr[x] = f(pr[x]); }

void un(int x, int y) {
    x = f(x); y = f(y);

    pr[x] = y;
}

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x1[i] >> yy1[i] >> x2[i] >> y2[i];
        if (x1[i] > x2[i])
            swap(x1[i], x2[i]);
        if (yy1[i] > y2[i])
            swap(yy1[i], y2[i]);
    }
    cin >> sx >> sy;

    for (int i = 0; i < n; i++)
        pr[i] = i;

    for (int i = 0; i <= 300; i++)
    for (int j = 0; j <= 300; j++)
        x[i][j] = -1, rs[i][j] = '.';

    for (int i = 0; i < n; i++)
    for (int j = x1[i]; j <= x2[i]; j++)
    for (int k = yy1[i]; k <= y2[i]; k++)
        if (x[j][k] == -1) x[j][k] = i;
            else un(x[j][k], i);

    fx = x[sx][sy];
    rghx = rghy = -1;
    lftx = lfty = 400;

    for (int i = 0; i < n; i++) {
        if (f(i) != f(fx))
            continue;

        lftx = min(lftx, x1[i]); rghx = max(rghx, x2[i]);
        lfty = min(lfty, yy1[i]); rghy = max(rghy, y2[i]);

        for (int j = x1[i]; j <= x2[i]; j++)
        for (int k = yy1[i]; k <= y2[i]; k++)
            rs[k][j] = '#';
    }

    for (int i = rghy; i >= lfty; i--, cout << el)
    for (int j = lftx; j <= rghx; j++)
        cout << rs[i][j];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
//        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

Subtask #1

70.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	896 KB	Output is correct
2	Correct	5 ms	1024 KB	Output is correct
3	Correct	68 ms	5240 KB	Output is correct
4	Correct	5 ms	896 KB	Output is correct
5	Correct	5 ms	896 KB	Output is correct
6	Correct	5 ms	896 KB	Output is correct
7	Correct	5 ms	896 KB	Output is correct
8	Correct	5 ms	1024 KB	Output is correct
9	Correct	5 ms	1024 KB	Output is correct
10	Correct	5 ms	896 KB	Output is correct