Submission #1056679

#TimeUsernameProblemLanguageResultExecution timeMemory
1056679ljtunas스파이 (JOI13_spy)C++17
30 / 100
270 ms262144 KiB
#include <bits/stdc++.h>// "i will win voi25" using namespace std; #define fi first #define se second #define Forv(v, h) for(auto &v : h) #define For(i, a, b) for(int i = a; i <= b; ++i) #define Ford(i, a, b) for(int i = a; i >= b; --i) #define all(h) h.begin(), h.end() #define reset(h, v) (memset(h, v, sizeof(h))) #define c_bit(i) __builtin_popcountll(i) #define Bit(mask, i) ((mask >> i) & 1) #define onbit(mask, i) ((mask) bitor (1LL << i)) #define offbit(mask, i) ((mask) &~ (1LL << i)) using ll = long long; using ii = pair<ll, ll>; using vi = vector<ll>; using vvi = vector<vi>; using vii = vector<ii>; template <class X, class Y> bool maximize(X &a, const Y &b) { if(a < b) return a = b, true; return false; } template <class X, class Y> bool minimize(X &a, const Y &b) { if(a > b) return a = b, true; return false; } // #define int long long const int dx[] = {0, -1, +1, 0}, dy[] = {-1, 0, 0, +1}; const ll oo = 1e18 + 1, base = 311, block = 500; const ll MOD = 1e9 + 7; const int MAXN = 5e5 + 5; int n, m, rA, rB; vector <int> gA[MAXN]; vector <int> gB[MAXN]; int r[MAXN], s[MAXN], inA[MAXN], inB[MAXN], enA[MAXN], enB[MAXN], idA[MAXN], idB[MAXN]; void dfsa (int u, int par) { static int timedfs = 0; inA[u] = ++timedfs, idA[timedfs] = u; for (int v : gA[u]) dfsa(v, u); enA[u] = timedfs; } void dfsb (int u, int par) { static int timedfs = 0; inB[u] = ++timedfs, idB[timedfs] = u; for (int v : gB[u]) dfsb(v, u); enB[u] = timedfs; } vector <int> vecA[MAXN], vecB[MAXN]; vector <int> mp[MAXN]; void process() { cin >> n >> m; For (i, 1, n) { int pa, pb; cin >> pa >> pb; if (!pa) rA = i; if (!pb) rB = i; gA[pa].push_back(i), gB[pb].push_back(i); } dfsa(rA, 0), dfsb(rB, 0); For (i, 1, m) { cin >> r[i] >> s[i]; mp[r[i]].push_back(s[i]); For (j, inA[r[i]], enA[r[i]]) vecA[idA[j]].emplace_back(r[i]); For (j, inB[s[i]], enB[s[i]]) vecB[idB[j]].emplace_back(s[i]); } For (i, 1, n) { sort (all(vecA[i])); vecA[i].resize(distance(vecA[i].begin(), unique(all(vecA[i])))); sort (all(vecB[i])); vecB[i].resize(distance(vecB[i].begin(), unique(all(vecB[i])))); } vector <int> cnt(n + 10, 0); For (i, 1, n) { int ans = 0; Forv(y, vecA[i]) { for (auto &v : mp[y]) cnt[v] ++; } Forv(x, vecB[i]) ans += cnt[x]; Forv(y, vecA[i]) { for (auto &v : mp[y]) cnt[v] --; } cout << ans << '\n'; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); #define name "a" if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); } //int tc = 1; cin >> tc; while (tc--) process(); // -> ac cerr << "\nTime elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << " s.\n"; return 0; }

Compilation message (stderr)

spy.cpp: In function 'int32_t main()':
spy.cpp:106:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |         freopen(name".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
spy.cpp:107:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |         freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...