oj.uz

답안 #339286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
339286 2020-12-25T03:19:53 Z 12tqian Paths (BOI18_paths) C++17
100 / 100
 893 ms 36180 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAX = 3e5 + 5;
vi adj[MAX];
ll num[MAX][5];
vpi edges;
int co[MAX];
ll res[6];
ll cnt[5][5];
vector<vi> states;
int main(){
    fast_io();
    int n, m, k;
    cin >> n >> m >> k;
    f0r(i,n) cin >> co[i];
    f0r(i, n) co[i]--;

    f0r(i, m){
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        adj[u].eb(v);
        adj[v].eb(u);
        edges.eb(mp(min(u, v), max(u, v)));
    }
    for(auto e: edges){
        num[e.f][co[e.s]]++;
        num[e.s][co[e.f]]++;
    }
    if(k >= 2){
        for(auto e: edges){
            if(co[e.f] != co[e.s]){
                res[2] += 2;
            }
        }
    }
    if(k >= 3){
        f0r(i, n){
            f0r(a, k){
                f0r(b, k){
                    if(a!= b && a!= co[i] && b != co[i]){
                        res[3] += num[i][a]*num[i][b];
                    }
                }
            }
        }
    }
    if(k>= 4){
        for(auto e: edges){
            f0r(a, k){
                f0r(b, k){
                    set<int> s;
                    s.insert(a);
                    s.insert(b);
                    s.insert(co[e.f]);
                    s.insert(co[e.s]);
                    if(sz(s) == 4){
                        res[4] += 2*num[e.f][a]*num[e.s][b];
                    }
                }
            }
        }
    }
    f0r(a, 4){
        f0r(b, 4){
            f0r(c, 4){
                f0r(d, 4){
                    set<int> s;
                    s.insert(a);
                    s.insert(b);
                    s.insert(c);
                    s.insert(d);
                    if(sz(s) == 4){
                        vi tmp;
                        tmp.eb(a);
                        tmp.eb(b);
                        tmp.eb(c);
                        tmp.eb(d);
                        states.eb(tmp);
                    }
                }
            }
        }
    }
    if(k >= 5){
        f0r(i, n){
            f0r(a, 5) f0r(b, 5) cnt[a][b] = 0;
            for(int nxt: adj[i]){
                f0r(j, 5){
                    cnt[co[nxt]][j] += num[nxt][j];
                }
            }
            vi colors;
            f0r(j, 5) if(j != co[i]) colors.eb(j);
            for(auto v: states){
                int a = colors[v[0]];
                int b = colors[v[1]];
                int c = colors[v[2]];
                int d = colors[v[3]];
                res[5] += cnt[a][b]*cnt[c][d];
            }

        }
    }
    ll ans = 0;
    f1r(i, 2, k+1) ans += res[i];
    cout << ans << endl;
    return 0;
}

Compilation message

paths.cpp:1: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    1 | #pragma comment(linker, "/stack:200000000")
      | 
paths.cpp: In function 'void io(std::string)':
paths.cpp:52:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   52 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
paths.cpp:53:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   53 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 6 ms 7404 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 6 ms 7404 KB Output is correct
9 Correct 6 ms 7404 KB Output is correct
10 Correct 6 ms 7404 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 17116 KB Output is correct
2 Correct 70 ms 17244 KB Output is correct
3 Correct 266 ms 35820 KB Output is correct
4 Correct 127 ms 18908 KB Output is correct
5 Correct 124 ms 18908 KB Output is correct
6 Correct 211 ms 29524 KB Output is correct
7 Correct 267 ms 35608 KB Output is correct
8 Correct 275 ms 36180 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 6 ms 7404 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 6 ms 7404 KB Output is correct
9 Correct 6 ms 7404 KB Output is correct
10 Correct 6 ms 7404 KB Output is correct
11 Correct 87 ms 17116 KB Output is correct
12 Correct 70 ms 17244 KB Output is correct
13 Correct 266 ms 35820 KB Output is correct
14 Correct 127 ms 18908 KB Output is correct
15 Correct 124 ms 18908 KB Output is correct
16 Correct 211 ms 29524 KB Output is correct
17 Correct 267 ms 35608 KB Output is correct
18 Correct 275 ms 36180 KB Output is correct
19 Correct 83 ms 17120 KB Output is correct
20 Correct 72 ms 17244 KB Output is correct
21 Correct 266 ms 35540 KB Output is correct
22 Correct 127 ms 18908 KB Output is correct
23 Correct 119 ms 18908 KB Output is correct
24 Correct 211 ms 29528 KB Output is correct
25 Correct 262 ms 35684 KB Output is correct
26 Correct 270 ms 36180 KB Output is correct
27 Correct 626 ms 17244 KB Output is correct
28 Correct 657 ms 18012 KB Output is correct
29 Correct 893 ms 35668 KB Output is correct
30 Correct 774 ms 26324 KB Output is correct
31 Correct 837 ms 26272 KB Output is correct
32 Correct 868 ms 35668 KB Output is correct
33 Correct 6 ms 7404 KB Output is correct
34 Correct 6 ms 7404 KB Output is correct
35 Correct 5 ms 7404 KB Output is correct
36 Correct 6 ms 7404 KB Output is correct
37 Correct 5 ms 7404 KB Output is correct
38 Correct 6 ms 7404 KB Output is correct
39 Correct 7 ms 7404 KB Output is correct
40 Correct 6 ms 7404 KB Output is correct
41 Correct 5 ms 7404 KB Output is correct
42 Correct 6 ms 7404 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7532 KB Output is correct
2 Correct 328 ms 10212 KB Output is correct
3 Correct 27 ms 10084 KB Output is correct
4 Correct 69 ms 16608 KB Output is correct
5 Correct 54 ms 17372 KB Output is correct
6 Correct 481 ms 16864 KB Output is correct
7 Correct 208 ms 10212 KB Output is correct
8 Correct 262 ms 16608 KB Output is correct
9 Correct 248 ms 17500 KB Output is correct
10 Correct 257 ms 17632 KB Output is correct
11 Correct 374 ms 13280 KB Output is correct
12 Correct 431 ms 15712 KB Output is correct
13 Correct 407 ms 13780 KB Output is correct
14 Correct 481 ms 16736 KB Output is correct
15 Correct 483 ms 16736 KB Output is correct
16 Correct 6 ms 7404 KB Output is correct
17 Correct 6 ms 7532 KB Output is correct
18 Correct 5 ms 7404 KB Output is correct
19 Correct 5 ms 7404 KB Output is correct
20 Correct 5 ms 7404 KB Output is correct
21 Correct 6 ms 7404 KB Output is correct
22 Correct 7 ms 7404 KB Output is correct
23 Correct 5 ms 7404 KB Output is correct
24 Correct 5 ms 7404 KB Output is correct
25 Correct 5 ms 7404 KB Output is correct