Submission #45135

#TimeUsernameProblemLanguageResultExecution timeMemory
45135realityBitaro’s Party (JOI18_bitaro)C++17
14 / 100
2116 ms481752 KiB
#include "bits/stdc++.h" using namespace std; #define fi first #define se second #define ll long long #define dbg(v) cerr<<#v<<" = "<<v<<'\n' #define vi vector<int> #define vl vector <ll> #define pii pair<int,int> #define mp make_pair #define db long double #define pb push_back #define all(s) s.begin(),s.end() template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;} template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;} const int N = (int)(1e6) + 5; inline int readChar(); template <class T = int> inline T readInt(); template <class T> inline void writeInt( T x, char end = 0 ); inline void writeChar( int x ); inline void writeWord( const char *s ); /** Read */ static const int buf_size = 4096; inline int getChar() { static char buf[buf_size]; static int len = 0, pos = 0; if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin); if (pos == len) return -1; return buf[pos++]; } inline int readChar() { int c = getChar(); while (c <= 32) c = getChar(); return c; } template <class T> inline T readInt() { int s = 1, c = readChar(); T x = 0; if (c == '-') s = -1, c = getChar(); while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar(); return s == 1 ? x : -x; } /** Write */ static int write_pos = 0; static char write_buf[buf_size]; inline void writeChar( int x ) { if (write_pos == buf_size) fwrite(write_buf, 1, buf_size, stdout), write_pos = 0; write_buf[write_pos++] = x; } template <class T> inline void writeInt( T x, char end ) { if (x < 0) writeChar('-'), x = -x; char s[24]; int n = 0; while (x || !n) s[n++] = '0' + x % 10, x /= 10; while (n--) writeChar(s[n]); if (end) writeChar(end); } inline void writeWord( const char *s ) { while (*s) writeChar(*s++); } struct Flusher { ~Flusher() { if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0; } } flusher; vi g[N]; vector < pii > D[N]; vi G[N]; int d[N]; int was[N]; const int C = 300; int main(void) { int n,m,qq; n = readInt(); m = readInt(); qq = readInt(); while (m --) { int u,v; u = readInt(); v = readInt(); g[v].pb(u); G[u].pb(v); } for (int i = 1;i <= n;++i) { D[i].pb(mp(0,i)); for (auto it : g[i]) { auto ss = D[it]; for (auto & w : ss) ++w.fi; vector < pii > nw; nw.resize(ss.size() + D[i].size()); merge(all(ss),all(D[i]),nw.begin(),greater < pii > ()); D[i].clear(); for (auto w : nw) { if (!was[w.se]) D[i].pb(w); was[w.se] = 1; } for (auto w : nw) was[w.se] = 0; if (D[i].size() > C) D[i].resize(C); } } while (qq --) { int vertex = readInt(); int Sz = readInt(); vi v; while (Sz --) { v.pb(readInt()); was[v.back()] = 1; } if (v.size() >= C) { for (int i = 1;i <= n;++i) d[i] = -1; d[vertex] = 0; for (int i = n;i;--i) for (auto it : G[i]) if (d[it] != -1) smax(d[i],d[it] + 1); int ans = -1; for (int i = 1;i <= n;++i) if (!was[i]) smax(ans,d[i]); writeInt(ans,'\n'); } else { int ans = -1; for (auto it : D[vertex]) if (!was[it.se]) smax(ans,it.fi); writeInt(ans,'\n'); } for (auto it : v) was[it] = 0; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...