oj.uz

답안 #239904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239904 2020-06-17T13:21:45 Z Vimmer Priglavci (COCI18_priglavci) C++14
16 / 160
 15 ms 896 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



int id[105], a[105];

int mn[105][105], mt[105], n, m, c, k;

ll limit;

int rst(int x, int y, int cx, int cy) {return pow((cx - x), 2) + pow((cy - y), 2);}

set <pair <int, int> > g[105];

bool mk[105];

bool kuna(int v)
{
    if (mk[v]) return 0;

    mk[v] = 1;

    for (auto it : g[v])
        if (it.F <= limit && (mt[it.S] == -1 || kuna(mt[it.S])))
            {
                a[v] = it.S;

                mt[it.S] = v;

                return 1;
            }

    return 0;
}

bool gd()
{
    memset(mt, -1, sizeof(mt));

    for (int i = 0; i < n; i++)
    {
        memset(mk, 0, sizeof(mk));

        kuna(i);
    }

    for (int i = 0; i < n; i++) if (a[i] == 0) return 0;

    return 1;
}
int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m >> c >> k;

    if (c * k < n) {cout << -1 << endl; exit(0);}

    int cx[n], cy[n];

    for (int i = 0; i < n; i++) cin >> cx[i] >> cy[i];

    for (int i = 0; i < 105; i++)
        for (int j = 0; j < 105; j++) mn[i][j] = 1e9;

    int sx[m], sy[m];

    for (int i = 0; i < m; i++) cin >> sx[i] >> sy[i];

    for (int i = 1; i <= k; i++)
    {
        int kol;

        cin >> kol;

        for (; kol > 0; kol--) {int x; cin >> x; x--; id[x] = i;}
    }

    if (k * c < n) {cout << -1 << endl; exit(0);}

    vector <int> values; values.clear();

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          {mn[i][id[j]] = min(mn[i][id[j]], rst(cx[i], cy[i], sx[j], sy[j])); values.pb(rst(cx[i], cy[i], sx[j], sy[j]));}

    for (int i = 0; i < n; i++)
        for (int j = 1; j <= k; j++)
          g[i].insert({mn[i][j], j});

    sort(values.begin(), values.end());

    int l = 0, r = sz(values) - 1;

    while (l + 1 < r)
    {
        ll md = (l + r) >> 1;

        limit = values[md];

        if (gd()) l = md; else r = md;
    }

    limit = values[l];

    while (!gd() && l > 0) {l--; limit = values[l];};

    limit = values[++l];

    while (gd() && l + 1 < sz(values)) {l++; limit = values[l];}

    limit = values[l - 1];

    int ans = 0;

    memset(mt, -1, sizeof(mt));

    for (int i = 0; i < n; i++)
    {
        memset(mk, 0, sizeof(mk));

        kuna(i);
    }

    for (int i = 0; i < n; i++) ans += mn[i][a[i]];

    cout << ans << endl;

    for (int i = 0; i < n; i++) cout << a[i] << endl;
}

Subtask #1
16.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Failed 6 ms 640 KB the weakness doesn't match with your distribution
2 Failed 5 ms 512 KB there exists a bus with more than C students
3 Correct 5 ms 384 KB Output is correct
4 Failed 7 ms 768 KB the weakness doesn't match with your distribution
5 Failed 7 ms 768 KB there exists a bus with more than C students
6 Incorrect 15 ms 896 KB Integer -1064683865 violates the range [-1, 2147483647]
7 Incorrect 6 ms 512 KB Integer 0 violates the range [1, 25]
8 Failed 5 ms 512 KB the weakness doesn't match with your distribution
9 Incorrect 13 ms 768 KB Integer -1769688853 violates the range [-1, 2147483647]
10 Incorrect 8 ms 512 KB Integer 0 violates the range [1, 100]