Submission #1057376

#TimeUsernameProblemLanguageResultExecution timeMemory
1057376mindiyakPaths (BOI18_paths)C++14
23 / 100
2025 ms1048576 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops") #include <bits/stdc++.h> #include <string> #include <iostream> #include <cmath> #include <numeric> #include <stack> #include <queue> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ld, ld> pd; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<vector<int>> vvi; typedef vector<vector<pi>> vvpi; typedef vector<ld> vd; typedef vector<long long> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; #define FOR(i, a, b) for (int i = a; i < (b); i++) #define F0R(i, a) for (int i = 0; i < (a); i++) #define FORd(i, a, b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--) #define trav(a, x) for (auto &a : x) #define uid(a, b) uniform_int_distribution<int>(a, b)(rng) #define len(x) (int)(x).size() #define mp make_pair #define pb push_back #define F first #define nl endl #define S second #define lb lower_bound #define ub upper_bound #define aint(x) x.begin(), x.end() #define raint(x) x.rbegin(), x.rend() #define ins insert const int M = 1e9+7; void init(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); } int n,m,k; vvi paths(3e5+10,vi()); vi color(3e5+10); ll ans = 0; map <string,int> cnt; int counter = 0; vvi permutations; void proc(vi perm){ vi arr2; int pos = 0; string a = ""; while(pos < perm.size()){ a += perm[pos]; if(cnt.count(a)==0){ vi arr3; if(pos == 0){ FOR(i,0,n){ if(color[i] == perm[pos]){ arr3.pb(i); } } }else{ for(int a:arr2){ for(int b:paths[a]){ if(color[b] == perm[pos]){ // FOR(i,0,pos+1)cerr << perm[i] << " "; // cerr << " | " << a << " " << b << " " << color[b] << endl; arr3.pb(b); } } } } cnt[a] = counter; counter ++; permutations.pb(arr3); } arr2 = permutations[cnt[a]]; pos ++; } } void solve() { cin >> n >> m >> k; FOR(i,0,n)cin >> color[i]; FOR(i,0,m){ int a,b;cin >> a >> b; a--;b--; paths[a].pb(b); paths[b].pb(a); } vi perm; FOR(i,1,k+1)perm.pb(i); do { proc(perm); } while (next_permutation(perm.begin(), perm.end())); // cerr << "****" << endl; for(auto& [key, value]:cnt){ // for(int a:key)cerr << a << " "; // cerr << " | "; // for(int a:value)cerr << a << " "; // cerr << endl; if(key.size() > 1)ans += permutations[value].size(); } cout << ans << endl; } int main() { fastIO(); // init("test"); int t = 1; // cin >> t; while (t--) solve(); return 0; }

Compilation message (stderr)

paths.cpp: In function 'void proc(vi)':
paths.cpp:66:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     while(pos < perm.size()){
      |           ~~~~^~~~~~~~~~~~~
paths.cpp: In function 'void solve()':
paths.cpp:115:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  115 |     for(auto& [key, value]:cnt){
      |               ^
paths.cpp: In function 'void init(std::string)':
paths.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
paths.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...