oj.uz

Submission #880781

# Submission time Handle Problem Language Result Execution time Memory
880781 2023-11-30T03:48:53 Z WeIlIaN 스파이 (JOI13_spy) C++14
100 / 100
 140 ms 16356 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <climits>
#include <iomanip>
using namespace std;

#define MOD 1000000007
#define fir first
#define sec second
#define mp make_pair
#define pushf push_front
#define pushb push_back
#define popf pop_front
#define popb pop_back
#define all(a) a.begin(), a.end()

#define FOR(i, s, e) for(int i = s; i < e; i++)
#define RFOR(i, s, e) for(int i = e-1; i >= s; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)

#pragma GCC optimize(" unroll-loops")
#pragma gcc optimize("Ofast")
#pragma GCC optimization("Ofast")

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vb> vvb;
typedef vector<vc> vvc;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef queue<int> qi;
typedef queue<ll> qll;
typedef queue<pii> qpii;
typedef queue<pll> qpll;
typedef deque<int> dqi;
typedef deque<ll> dqll;
typedef deque<pii> dqpii;
typedef deque<pll> dqpll;  
typedef priority_queue<int> pqi;
typedef priority_queue<ll> pqll;
typedef priority_queue<pii> pqpii;
typedef priority_queue<pll> pqpll;
typedef priority_queue<int, vi, greater<int> > r_pqi;
typedef priority_queue<ll, vll, greater<ll> > r_pqll;
typedef priority_queue<pii, vpii, greater<pii> > r_pqpii;
typedef priority_queue<pll, vpll, greater<pll> > r_pqpll;

vi child[2][2003];
int n, m, a, r, s, root[2], f[2003][2003];

void dfs1(int u) {
    for(auto v : child[0][u]) {
        REP(i, n) {
            f[v][i] += f[u][i];
        }
        dfs1(v);
    }
}

void dfs2(int u) {
    for(auto v : child[1][u]) {
        REP(i, n) {
            f[i][v] += f[i][u];
        }
        dfs2(v);
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    REP(i, n) {
        REP(j, 2) {
            cin>>a;
            if(a == 0) root[j] = i;
            else child[j][--a].push_back(i);
        }
    }

    REP(i, m) {
        cin>>r>>s;
        f[--r][--s]++;
    }

    dfs1(root[0]);
    dfs2(root[1]);
    REP(i, n) {
        cout<<f[i][i]<<endl;
    }
    return 0;
}

Compilation message

spy.cpp:31: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
   31 | #pragma gcc optimize("Ofast")
      | 
spy.cpp:32: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   32 | #pragma GCC optimization("Ofast")
      | 
spy.cpp:30:37: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
   30 | #pragma GCC optimize(" unroll-loops")
      |                                     ^
spy.cpp:70:16: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   70 | void dfs1(int u) {
      |                ^
spy.cpp:79:16: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   79 | void dfs2(int u) {
      |                ^
spy.cpp:88:10: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   88 | int main() {
      |          ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 504 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 16220 KB Output is correct
2 Correct 43 ms 16220 KB Output is correct
3 Correct 32 ms 16232 KB Output is correct
4 Correct 30 ms 16220 KB Output is correct
5 Correct 38 ms 16216 KB Output is correct
6 Correct 35 ms 16220 KB Output is correct
7 Correct 35 ms 16220 KB Output is correct
8 Correct 36 ms 16220 KB Output is correct

Subtask #3
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 16356 KB Output is correct
2 Correct 85 ms 16316 KB Output is correct
3 Correct 78 ms 16244 KB Output is correct
4 Correct 84 ms 16232 KB Output is correct
5 Correct 104 ms 16300 KB Output is correct
6 Correct 91 ms 16132 KB Output is correct
7 Correct 140 ms 16336 KB Output is correct
8 Correct 107 ms 16220 KB Output is correct