#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];
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 (mt[it.S] == -1 || kuna(mt[it.S]))
{
a[v] = it.S;
mt[it.S] = v;
return 1;
}
return 0;
}
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);
int n, m, c, k;
cin >> n >> m >> c >> k;
if (c * k < 1e9 ) {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);}
//
// 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]));
//
// for (int i = 0; i < n; i++)
// for (int j = 1; j <= k; j++)
// g[i].insert({mn[i][j], j});
//
// int ans = 0;
//
// memset(mt, -1, sizeof(mt));
//
// for (int i = n - 1; i >= 0; 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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 2 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
| 3 |
Correct |
4 ms |
384 KB |
Output is correct |
| 4 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 5 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
| 6 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 7 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
| 8 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
| 9 |
Incorrect |
4 ms |
256 KB |
Output isn't correct |
| 10 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
