#include "train.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v)
{
vi res,yol[6000];
deque<int>g,gg;
for (int i=0;i<sz(u);i++) yol[u[i]].pb(v[i]);
for (int i=0;i<sz(a);i++)
{
if (a[i]==0 && r[i]==0)
{
bool b=0;
for (int j=0;j<sz(yol[i]);j++)
{
if (yol[i][j]==i)
{
b=1;
break;
}
}
if (b) g.pb(i);
}
}
for (int i=0;i<sz(u);i++)
{
if (u[i]==v[i] && a[u[i]]==1 && r[u[i]]==1)
{
gg.pb(u[i]);
}
if (yol[u[i]].size()==1 && yol[u[i]][0]==u[i] && r[u[i]]==1)
{
gg.pb(u[i]);
}
}
for (int i=0;i<sz(a);i++)
{
while(i>g.front())g.pop_front();
while(i>gg.front())gg.pop_front();
if (g.front()<gg.front())res.pb(0);
else res.pb(1);
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
5 ms |
1536 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
768 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
8 ms |
1920 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
8 ms |
1664 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
9 ms |
1920 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
5 ms |
1536 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |