#include "train.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define ll long long
const int N=5555;
vector<int> adj[N];
int vis[N];
vector<int> p1(vector<int>a,vector<int>r,vector<int>u,vector<int>v) {
int n=a.size(), m=u.size();
vector<int> s(n);
vector<int> f(n);
vector<int> ans(n);
forn(i,m) if (u[i]==v[i]) s[u[i]]=1;
forn(i,m) if (u[i]!=v[i]) f[u[i]]=1;
int now=0;
for (int i=n-1; i>=0; --i) {
if (s[i]) {
if (now) {
if (!a[i]) {
if (!r[i]) now=0;
} else {
if (f[i]) now=1;
else now = r[i];
}
} else {
if (a[i]) {
if (r[i]) now=1;
} else {
if (f[i]) now=0;
else now = r[i];
}
}
}
ans[i]=now;
}
return ans;
}
vector<int> p3(vector<int>a,vector<int>r,vector<int>u,vector<int>v) {
int n=a.size(), m=u.size();
vector<int> ans(n);
vector<int> ok(n);
}
vector<int> p4(vector<int>a,vector<int>r,vector<int>u,vector<int>v) {
int n=a.size(), m=u.size();
vector<int> s(n);
vector<int> ans(n);
forn(i,m) if (u[i]==v[i]) s[i]=1;
int now;
for (int i=n-1; i>=0; --i) {
if (s[i]) now=a[i];
ans[i]=now;
}
return ans;
}
vector<int> who_wins(vector<int>a,vector<int>r,vector<int>u,vector<int>v) {
int n=a.size(), m=u.size();
int z=1;
forn(i,m) z&=(u[i]==v[i]) || (v[i]==(u[i]+1));
if (z) {
return p1(a,r,u,v);
}
exit(0);
return vector<int>(n,0);
z=1;
forn(i,n) z&=a[i];
if (z) return p3(a,r,u,v);
forn(i,n) z|=a[i];
if (!z) return p4(a,r,u,v);
}
Compilation message
train.cpp: In function 'std::vector<int> p3(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:44:18: warning: unused variable 'm' [-Wunused-variable]
44 | int n=a.size(), m=u.size();
| ^
train.cpp:47:1: warning: no return statement in function returning non-void [-Wreturn-type]
47 | }
| ^
train.cpp: In function 'std::vector<int> p4(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:57:9: warning: 'now' may be used uninitialized in this function [-Wmaybe-uninitialized]
57 | ans[i]=now;
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
724 KB |
Output is correct |
2 |
Correct |
3 ms |
836 KB |
Output is correct |
3 |
Correct |
3 ms |
744 KB |
Output is correct |
4 |
Correct |
3 ms |
744 KB |
Output is correct |
5 |
Correct |
3 ms |
736 KB |
Output is correct |
6 |
Correct |
3 ms |
736 KB |
Output is correct |
7 |
Correct |
3 ms |
732 KB |
Output is correct |
8 |
Correct |
3 ms |
852 KB |
Output is correct |
9 |
Correct |
4 ms |
836 KB |
Output is correct |
10 |
Correct |
4 ms |
724 KB |
Output is correct |
11 |
Correct |
3 ms |
724 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
secret mismatch |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
724 KB |
secret mismatch |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
724 KB |
secret mismatch |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
736 KB |
secret mismatch |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
724 KB |
Output is correct |
2 |
Correct |
3 ms |
836 KB |
Output is correct |
3 |
Correct |
3 ms |
744 KB |
Output is correct |
4 |
Correct |
3 ms |
744 KB |
Output is correct |
5 |
Correct |
3 ms |
736 KB |
Output is correct |
6 |
Correct |
3 ms |
736 KB |
Output is correct |
7 |
Correct |
3 ms |
732 KB |
Output is correct |
8 |
Correct |
3 ms |
852 KB |
Output is correct |
9 |
Correct |
4 ms |
836 KB |
Output is correct |
10 |
Correct |
4 ms |
724 KB |
Output is correct |
11 |
Correct |
3 ms |
724 KB |
Output is correct |
12 |
Incorrect |
1 ms |
340 KB |
secret mismatch |
13 |
Halted |
0 ms |
0 KB |
- |