oj.uz

Submission #927150

# Submission time Handle Problem Language Result Execution time Memory
927150 2024-02-14T10:26:45 Z vjudge1 Paths (BOI18_paths) C++17
23 / 100
 3000 ms 28752 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

ll add (ll a, ll b) {
	a += b;
	if (a < 0) a += mod;
	if (a >= mod) a -= mod;
	return a;
}

ll mul (ll a, ll b) {
	a *= b;
	if (a >= mod) a %= mod;
	return a;
}

int n, m, k, a[N], c[5], cnt[5];
vt<int> g[N];

void dfs (int v, int dist = 0) {
	c[dist] = v, cnt[dist]++;
	if (dist > 3) return;
	for (auto to: g[v]) {
		bool ok = 1;
		for (int d = 0; d <= dist; d++) ok &= (to != c[d] && a[to] != a[c[d]]);
		if (ok) dfs(to, dist + 1);
	}
} 

void solve () {
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].pb(y), g[y].pb(x);
	}
	for (int i = 1; i <= n; i++) dfs(i), cnt[0]--;
	cout << (cnt[1] + cnt[2] + cnt[3] + cnt[4]);
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef AMIR
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 25176 KB Output is correct
2 Correct 7 ms 25180 KB Output is correct
3 Correct 7 ms 25180 KB Output is correct
4 Correct 7 ms 25180 KB Output is correct
5 Correct 7 ms 25260 KB Output is correct
6 Correct 7 ms 25180 KB Output is correct
7 Correct 8 ms 25216 KB Output is correct
8 Correct 7 ms 25180 KB Output is correct
9 Correct 8 ms 25176 KB Output is correct
10 Correct 7 ms 25180 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3054 ms 28752 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 25176 KB Output is correct
2 Correct 7 ms 25180 KB Output is correct
3 Correct 7 ms 25180 KB Output is correct
4 Correct 7 ms 25180 KB Output is correct
5 Correct 7 ms 25260 KB Output is correct
6 Correct 7 ms 25180 KB Output is correct
7 Correct 8 ms 25216 KB Output is correct
8 Correct 7 ms 25180 KB Output is correct
9 Correct 8 ms 25176 KB Output is correct
10 Correct 7 ms 25180 KB Output is correct
11 Execution timed out 3054 ms 28752 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 25180 KB Output is correct
2 Execution timed out 3064 ms 26204 KB Time limit exceeded
3 Halted 0 ms 0 KB -