| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 699693 |
2023-02-17T19:35:11 Z |
Lobo |
Parking (CEOI22_parking) |
C++17 |
|
99 ms |
43576 KB |
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 2e5+10;
int n, m, b[maxn], t[maxn], in[maxn], done[maxn], out[maxn];
vector<int> pos[maxn], ot[3], g[maxn];
void solve() {
cin >> n >> m;
vector<int> ept;
for(int i = 1; i <= m; i++) {
cin >> b[i] >> t[i];
if(b[i] == 0) {
ept.pb(i);
continue;
}
if(b[i] != 0) pos[b[i]].pb(i);
if(t[i] != 0) pos[t[i]].pb(i+m);
if(b[i] == t[i]) {
done[b[i]] = 1;
}
else if(b[i] != 0 && t[i] != 0) {
g[t[i]].pb(b[i]);
out[t[i]]++;
in[b[i]]++;
}
}
for(int i = 1; i <= n; i++) {
if(done[i] == 0 && in[i] == 0) {
ot[out[i]].pb(i);
}
}
vector<pair<int,int>> ans;
while(true) {
if(ot[0].size()) {
int i = ot[0].back(); ot[0].pop_back(); done[i] = 1;
sort(all(pos[i]));
int p1 = pos[i][0];
int p2 = pos[i][1];
ans.pb(mp(p1,p2));
b[p1] = 0;
t[p2] = i;
ept.pb(p1);
pos[i][0] = p2+m;
}
else if(ot[1].size()) {
int i = ot[1].back(); ot[1].pop_back(); done[i] = 1;
sort(all(pos[i]));
int p1 = pos[i][0];
int p2 = pos[i][1];
ans.pb(mp(p2,p1));
t[p2-m] = 0;
for(auto x : g[i]) {
if(--in[x] == 0) {
ot[out[x]].pb(x);
}
}
t[p1] = i;
pos[i][1] = p1+m;
}
else if(ot[2].size() && ept.size()) {
int i = ot[2].back(); ot[2].pop_back(); done[i] = 1;
int e = ept.back(); ept.pop_back();
sort(all(pos[i]));
int p1 = pos[i][0];
int p2 = pos[i][1];
ans.pb(mp(p1,e));
ans.pb(mp(p2,e));
t[p1-m] = 0;
t[p2-m] = 0;
for(auto x : g[i]) {
if(--in[x] == 0) {
ot[out[x]].pb(x);
}
}
b[e] = i;
t[e] = i;
pos[i][0] = e;
pos[i][1] = e+m;
}
else if(ept.size()) {
int sz = ept.size();
for(int j = 1; j <= m; j++) {
if(b[j] != t[j]) {
int i = t[j];
int e = ept.back(); ept.pop_back();
sort(all(pos[i]));
t[j] = 0;
b[e] = i;
if(pos[i][0] == j+m) pos[i][0] = e;
else pos[i][1] = e;
if(--in[b[j]] == 0) {
ot[out[b[j]]].pb(b[j]);
}
break;
}
}
assert(sz != ept.size());
}
else {
break;
}
}
for(int i = 1; i <= n; i++) {
if(done[i] == 0) {
cout << -1 << endl;
return;
}
}
cout << ans.size() << endl;
for(auto x : ans) {
if(x.fr > m) x.fr-= m;
if(x.sc > m) x.sc-= m;
cout << x.fr << " " << x.sc << endl;
}
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(0);
// freopen("in.in", "r", stdin);
// freopen("out.out", "w", stdout);
int tt = 1;
// cin >> tt;
while(tt--) {
solve();
}
}
Compilation message
In file included from /usr/include/c++/10/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
from Main.cpp:1:
Main.cpp: In function 'void solve()':
Main.cpp:113:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
113 | assert(sz != ept.size());
| ~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
13 ms |
19504 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
99 ms |
43576 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
17 ms |
19796 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
13 ms |
19504 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
