| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 198402 |
2020-01-25T22:34:51 Z |
Benq |
Fire drill (LMIO18_sauga) |
C++14 |
|
855 ms |
3112 KB |
#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 = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
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 v;
explicit operator T() const { return v; }
mi() { v = 0; }
mi(ll _v) {
v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
if (v < 0) v += MOD;
}
friend bool operator==(const mi& a, const mi& b) {
return a.v == b.v; }
friend bool operator!=(const mi& a, const mi& b) {
return !(a == b); }
friend bool operator<(const mi& a, const mi& b) {
return a.v < b.v; }
friend void re(mi& a) { ll x; re(x); a = mi(x); }
friend void pr(const mi& a) { pr(a.v); }
friend ostream& operator<<(ostream& os, const mi& a) {
return os << a.v; }
mi operator-() const { return mi(-v); }
mi& operator+=(const mi& m) {
if ((v += m.v) >= MOD) v -= MOD;
return *this; }
mi& operator-=(const mi& m) {
if ((v -= m.v) < 0) v += 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) {
v = (ll)v*m.v%MOD; return *this; }
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; }
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.v != 0); return pow(a,MOD-2); }
};
typedef vector<mi> vmi;
typedef pair<mi,mi> pmi;
typedef vector<pmi> vpmi;
vector<vmi> comb;
void genComb(int SZ) {
comb.assign(SZ,vmi(SZ)); comb[0][0] = 1;
FOR(i,1,SZ) F0R(j,i+1)
comb[i][j] = comb[i-1][j]+(j?comb[i-1][j-1]:0);
}
vi verts;
bool vis[1001], inSt[1001];
vi ed[1001];
int to[1001];
vi adj[1001];
vi seq, st;
bool active[1001];
bool dfs(int x) {
if (!active[x]) return 0;
// ps("OH",x);
vis[x] = inSt[x] = 1; st.pb(x);
trav(t,adj[x]) if (active[t]) {
if (inSt[t]) {
active[x] = 0; st.pop_back();
return 0;
}
}
trav(t,adj[x]) if (active[t]) {
if (!vis[t]) {
if (dfs(t)) return 1;
}
}
inSt[x] = 0; st.pop_back(); seq.pb(x);
return 0;
}
int T,N,S;
pair<int,vi> solve() {
FOR(i,1,N+1) random_shuffle(all(adj[i]));
FOR(i,1,N+1) active[i] = 1;
// while (1) {
//FOR(i,1,N+1) pr((int)active[i]);
//ps();
seq = st = {};
random_shuffle(all(verts));
FOR(i,1,N+1) {
vis[i] = inSt[i] = 0;
// random_shuffle(all(adj[i]));
}
bool bad = 0;
trav(t,verts) if (!vis[t] && dfs(t)) {
bad = 1;
break;
}
// ps("WUT");
vi ans;
FOR(i,1,N+1) if (!active[i]) ans.pb(i);
int lef = N-sz(ans);
trav(t,seq) ans.pb(t);
return {lef,ans};
// }
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
re(T,N,S); FOR(i,1,N+1) verts.pb(i);
FOR(i,1,N+1) {
int b; re(b);
F0R(j,b) {
int x; re(x);
adj[i].pb(x);
//ps("ADJ",x,i);
}
}
clock_t beg = clock();
pair<int,vi> ans;
while ((db)(clock()-beg)/CLOCKS_PER_SEC < 0.8) {
auto a = solve();
ckmax(ans,a);
}
trav(t,ans.s) ps(t);
// while((db)(beg-clock()))
// you should actually read the stuff at the bottom
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
*/
Compilation message
sauga.cpp: In function 'std::pair<int, std::vector<int> > solve()':
sauga.cpp:249:7: warning: variable 'bad' set but not used [-Wunused-but-set-variable]
bool bad = 0;
^~~
sauga.cpp: In function 'void io::setIn(std::__cxx11::string)':
sauga.cpp:140:32: 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); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
sauga.cpp: In function 'void io::setOut(std::__cxx11::string)':
sauga.cpp:141:33: 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); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
855 ms |
3112 KB |
Output is correct |
| 2 |
Partially correct |
803 ms |
500 KB |
Output is partially correct |
| 3 |
Partially correct |
803 ms |
504 KB |
Output is partially correct |
| 4 |
Partially correct |
803 ms |
516 KB |
Output is partially correct |
| 5 |
Partially correct |
803 ms |
508 KB |
Output is partially correct |
| 6 |
Partially correct |
803 ms |
520 KB |
Output is partially correct |
| 7 |
Correct |
812 ms |
924 KB |
Output is correct |
| 8 |
Correct |
850 ms |
3064 KB |
Output is correct |
| 9 |
Correct |
808 ms |
720 KB |
Output is correct |
| 10 |
Correct |
803 ms |
604 KB |
Output is correct |
