Submission #9294250
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#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
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int xd[4] = {0,1,0,-1}, yd[4] = {1,0,-1,0};
template<class T> bool ckmin(T& a, const T& b) {
return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
rb_tree_tag, tree_order_statistics_node_update>;
// change null_type for map
#define ook order_of_key
#define fbo find_by_order
void treeExample() {
Tree<int> t, t2; t.insert(8);
auto it = t.insert(10).f; assert(it == t.lb(9));
assert(t.ook(10) == 1); assert(t.ook(11) == 2);
assert(*t.fbo(0) == 8);
t.join(t2); // assuming T < T2 or T > T2, merge t2 into t
}
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class T, class... Ts> void re(T& t, Ts&... ts) {
re(t); re(ts...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
void pr(int x) { cout << x; }
void pr(long x) { cout << x; }
void pr(ll x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(ld x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char* x) { cout << x; }
void pr(const string& x) { cout << x; }
void pr(bool x) { pr(x ? "true" : "false"); }
template<class T> void pr(const complex<T>& x) { cout << x; }
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T> void pr(const T& x);
template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
pr(t); pr(ts...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void pr(const T& x) {
pr("{"); // const iterator needed for vector<bool>
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
void ps() { pr("\n"); } // print w/ spaces
template<class T, class... Ts> void ps(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(" "); ps(ts...);
}
void pc() { pr("]\n"); } // debug w/ commas
template<class T, class... Ts> void pc(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(", "); pc(ts...);
}
#define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
// cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
struct mi {
typedef decay<decltype(MOD)>::type T;
T val;
explicit operator T() const { return val; }
mi() { val = 0; }
mi(ll v) {
val = (-MOD <= v && v <= MOD) ? v : v % MOD;
if (val < 0) val += MOD;
}
friend bool operator==(const mi& a, const mi& b) {
return a.val == b.val; }
friend bool operator!=(const mi& a, const mi& b) {
return !(a == b); }
friend bool operator<(const mi& a, const mi& b) {
return a.val < b.val; }
friend void re(mi& a) { ll x; re(x); a = mi(x); }
friend void pr(const mi& a) { pr(a.val); }
friend ostream& operator<<(ostream& os, const mi& a) {
return os << a.val; }
mi operator-() const { return mi(-val); }
mi& operator+=(const mi& m) {
if ((val += m.val) >= MOD) val -= MOD;
return *this; }
mi& operator-=(const mi& m) {
if ((val -= m.val) < 0) val += MOD;
return *this; }
mi& operator++() { return *this += 1; }
mi& operator--() { return *this -= 1; }
friend mi operator+(mi a, const mi& b) { return a += b; }
friend mi operator-(mi a, const mi& b) { return a -= b; }
mi& operator*=(const mi& m) {
val = (ll)val*m.val%MOD; return *this; }
friend mi pow(mi a, ll p) {
mi ans = 1; assert(p >= 0);
for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend mi inv(const mi& a) {
assert(!(a == 0)); return pow(a,MOD-2); }
mi& operator/=(const mi& m) { return (*this) *= inv(m); }
friend mi operator*(mi a, const mi& b) { return a *= b; }
friend mi operator/(mi a, const mi& b) { return a /= b; }
};
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
int N,ins[4][300], ver[300], hor[300], dir[300][300];
pi nex[300][300][4];
str lets = "UDLR";
vpi st;
bool vis[300][300];
const pi ID = mp(MOD,MOD);
void prin() {
// ps("ER",nex[])
/*F0R(i,N) {
F0R(j,N) {
if (dir[i][j] == MOD) pr('*');
else pr(dir[i][j]);
}
ps();
}
ps("------");*/
}
void rem(int a, int b) {
int& d = dir[a][b];
assert(d != MOD);
if (nex[a][b][d] != ID) {
ps("REM",a,b,d,nex[a][b][d]);
exit(5);
}
if (d == 0) {
pr("U",b+1,'\n');
} else if (d == 1) {
pr("D",b+1,'\n');
} else if (d == 2) {
pr("L",a+1,'\n');
} else {
pr("R",a+1,'\n');
}
for (int i = 0; i <= 2; i += 2) {
pi x = nex[a][b][i], y = nex[a][b][i^1];
if (x != ID) nex[x.f][x.s][i^1] = y;
if (y != ID) nex[y.f][y.s][i] = x;
}
d = MOD;
prin();
}
void solve(pi p) {
// if (p == ID || dir[p.f][p.s] == MOD) return;
if (vis[p.f][p.s]) {
prin();
int ind = sz(st)-1;
while (st[ind] != p) ind --;
vi v;
FOR(i,ind,sz(st)) v.pb(dir[st[i].f][st[i].s]);
rotate(begin(v),end(v)-1,end(v));
FOR(i,ind,sz(st)) dir[st[i].f][st[i].s] = v[i-ind];
while (sz(st) > ind+1) {
vis[st.back().f][st.back().s] = 0;
st.pop_back();
}
prin();
return;
}
vis[p.f][p.s] = 1; st.pb(p);
while (1) {
if (!vis[p.f][p.s]) return;
if (nex[p.f][p.s][dir[p.f][p.s]] == ID) break;
solve(nex[p.f][p.s][dir[p.f][p.s]]);
}
vis[p.f][p.s] = 0; st.pop_back();
rem(p.f,p.s);
}
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0);
re(N);
F0R(i,4) F0R(j,N) {
re(ins[i][j]);
if (i <= 1) ver[j] += ins[i][j];
else hor[j] += ins[i][j];
}
F0R(i,N) if (ver[i] > N || hor[i] > N) {
ps("NO");
exit(0);
}
F0R(i,N) {
vpi v;
F0R(j,N) v.pb({ver[j],j});
sort(rall(v));
// ps("??",v,N-hor[i]);
F0R(j,N) dir[i][j] = 2;
F0R(j,N-hor[i]) {
dir[i][v[j].s] = 0;
if (ver[v[j].s] == 0) {
ps("NO");
exit(0);
}
ver[v[j].s] --;
}
}
F0R(i,N) {
F0R(j,N) if (dir[i][j] == 2) {
if (ins[3][i]) dir[i][j] = 3, ins[3][i] --;
}
}
F0R(j,N) {
F0R(i,N) if (dir[i][j] == 0) {
if (ins[1][j]) dir[i][j] = 1, ins[1][j] --;
}
}
F0R(j,N) {
pi lst = {MOD,MOD};
F0R(i,N) {
nex[i][j][0] = lst;
lst = {i,j};
}
lst = {MOD,MOD};
R0F(i,N) {
nex[i][j][1] = lst;
lst = {i,j};
}
}
F0R(i,N) {
pi lst = {MOD,MOD};
F0R(j,N) {
nex[i][j][2] = lst;
lst = {i,j};
}
lst = {MOD,MOD};
R0F(j,N) {
nex[i][j][3] = lst;
lst = {i,j};
}
}
F0R(i,N) F0R(j,N) if (dir[i][j] != MOD) solve({i,j});
/*F0R(i,N) {
F0R(j,N) pr(dir[i][j]);
ps();
}*/
// you should actually read the stuff at the bottom
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), slow multiset operations
* do smth instead of nothing and stay organized
*/
Submission Info
Submission Time |
|
Task |
J - Neue Spiel |
User |
Benq |
Language |
C++14 (GCC 5.4.1) |
Score |
2100 |
Code Size |
9184 Byte |
Status |
AC |
Exec Time |
685 ms |
Memory |
4224 KB |
Compile Error
./Main.cpp: In function ‘void io::setIn(std::string)’:
./Main.cpp:140:53: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
^
./Main.cpp: In function ‘void io::setOut(std::string)’:
./Main.cpp:141:55: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
^
Judge Result
Set Name |
sample |
dataset1 |
dataset2 |
Score / Max Score |
0 / 0 |
2000 / 2000 |
100 / 100 |
Status |
|
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt |
dataset1 |
sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt |
dataset2 |
sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
1 ms |
256 KB |
01-02.txt |
AC |
1 ms |
256 KB |
01-03.txt |
AC |
1 ms |
256 KB |
01-04.txt |
AC |
1 ms |
256 KB |
01-05.txt |
AC |
2 ms |
384 KB |
01-06.txt |
AC |
2 ms |
512 KB |
01-07.txt |
AC |
3 ms |
512 KB |
01-08.txt |
AC |
3 ms |
512 KB |
01-09.txt |
AC |
1 ms |
384 KB |
01-10.txt |
AC |
3 ms |
512 KB |
01-11.txt |
AC |
3 ms |
512 KB |
01-12.txt |
AC |
3 ms |
512 KB |
01-13.txt |
AC |
3 ms |
512 KB |
01-14.txt |
AC |
1 ms |
256 KB |
01-15.txt |
AC |
3 ms |
512 KB |
01-16.txt |
AC |
3 ms |
512 KB |
01-17.txt |
AC |
3 ms |
512 KB |
01-18.txt |
AC |
3 ms |
512 KB |
01-19.txt |
AC |
1 ms |
256 KB |
01-20.txt |
AC |
3 ms |
512 KB |
01-21.txt |
AC |
3 ms |
512 KB |
01-22.txt |
AC |
1 ms |
256 KB |
01-23.txt |
AC |
1 ms |
256 KB |
01-24.txt |
AC |
3 ms |
512 KB |
01-25.txt |
AC |
3 ms |
512 KB |
01-26.txt |
AC |
1 ms |
256 KB |
01-27.txt |
AC |
2 ms |
384 KB |
01-28.txt |
AC |
3 ms |
512 KB |
01-29.txt |
AC |
3 ms |
512 KB |
01-30.txt |
AC |
3 ms |
512 KB |
01-31.txt |
AC |
1 ms |
256 KB |
01-32.txt |
AC |
3 ms |
512 KB |
01-33.txt |
AC |
1 ms |
256 KB |
01-34.txt |
AC |
3 ms |
512 KB |
01-35.txt |
AC |
2 ms |
512 KB |
01-36.txt |
AC |
2 ms |
512 KB |
01-37.txt |
AC |
1 ms |
256 KB |
01-38.txt |
AC |
3 ms |
512 KB |
01-39.txt |
AC |
3 ms |
512 KB |
01-40.txt |
AC |
2 ms |
512 KB |
01-41.txt |
AC |
2 ms |
512 KB |
01-42.txt |
AC |
2 ms |
512 KB |
01-43.txt |
AC |
2 ms |
512 KB |
01-44.txt |
AC |
2 ms |
512 KB |
01-45.txt |
AC |
2 ms |
512 KB |
01-46.txt |
AC |
2 ms |
512 KB |
02-01.txt |
AC |
566 ms |
4224 KB |
02-02.txt |
AC |
603 ms |
4224 KB |
02-03.txt |
AC |
685 ms |
4224 KB |
02-04.txt |
AC |
440 ms |
4096 KB |
02-05.txt |
AC |
1 ms |
256 KB |
02-06.txt |
AC |
1 ms |
256 KB |
02-07.txt |
AC |
515 ms |
3968 KB |
02-08.txt |
AC |
110 ms |
4224 KB |
02-09.txt |
AC |
22 ms |
3968 KB |
02-10.txt |
AC |
159 ms |
3968 KB |
02-11.txt |
AC |
22 ms |
3968 KB |
02-12.txt |
AC |
166 ms |
3968 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |