oj.uz

Submission #547360

# Submission time Handle Problem Language Result Execution time Memory
547360 2022-04-10T14:01:41 Z blue Reconstruction Project (JOI22_reconstruction) C++17
31 / 100
 5000 ms 16076 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vi>;
#define sz(x) int(x.size())

struct edge
{
	int a;
	int b;
	ll w;
};

bool operator < (edge A, edge B)
{
	return A.w < B.w;
}

struct costchange
{
	ll w;
	ll deltaX;
	ll deltaC;
};

bool operator < (costchange A, costchange B)
{
	return A.w < B.w;
}



const int maxM = 100'000;

vi A(maxM), B(maxM), W(maxM);




vvi adj; //done

vi vis; //done
vi cyclic; //done

vi st; //done

vi paredge;

bool discovered;

void dfs(int u, int pe)
{
	// cerr << "\n\n\n\n";
	// cerr << "enter : dfs " << u << ' ' << p << '\n';
	vis[u] = 1;

	st.push_back(u);
	for(int e : adj[u])
	{
		// cerr << "enter edge\n";
		int v = A[e] + B[e] - u;

		// cerr << u << " -> " << v << '\n';
		if(e == pe) 
		{
			// cerr << "case 1\n";
			continue;
		}
		else if(vis[v])
		{
			if(!discovered)
			{
				discovered = 1;
				// cerr << "case 2\n";

				// cerr << "paredge v = " << paredge[v] << '\n';
				// for(int f : st) cerr << "f = " << f << " : " << paredge[f] << '\n';

				for(int k = sz(st) - 1; k >= 0 && st[k] != v; k--)
				{
					// cerr << "checking : k = " << k << '\n';
					// if(paredge[st[k]] == -1) cerr << "ATTENTION : V = " << v << '\n'; 
					cyclic.push_back(paredge[st[k]]);
				}
				cyclic.push_back(e);
				// cerr << "case 2 done\n";
			}
			
		}
		else
		{
			// cerr << "case 3\n";
			paredge[v] = e;
			dfs(v, e);
		}

	}
	st.pop_back();
}








int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int N, M;
	cin >> N >> M;

	vector<edge> E(M);
	for(int j = 0; j < M; j++)
	{
		cin >> E[j].a >> E[j].b >> E[j].w;
		E[j].a--;
		E[j].b--;
	}
	sort(E.begin(), E.end());

	for(int j = 0; j < M; j++)
	{
		A[j] = E[j].a;
		B[j] = E[j].b;
		W[j] = E[j].w;
	}

	// cerr << "\n\n\n edges = \n";
	// for(int j = 0; j < M; j++) cerr << A[j] << ' ' << B[j] << ' ' << W[j] << '\n';
	// 	cerr << "\n\n";




	vi edgelist;


	vll minW(M), maxW(M); //do 2x the actual thing!!!

	for(int j = 0; j < M; j++)
	{
		// cerr << "\n\n\n\n\n\n\n";
		// cerr << "j = " << j << '\n';
		vis = vi(N, 0);

		edgelist.push_back(j);

		// cerr << "edgelist : \n";
		// for(int e : edgelist)
		// 	cerr << A[e] << ' ' << B[e] << ' ' << W[e] << '\n';

		// cerr << "###\n";
		adj = vvi(N);
		for(int e : edgelist)
		{
			adj[A[e]].push_back(e);
			adj[B[e]].push_back(e);
		}

		cyclic.clear();

		discovered = 0;

		st.clear();

		paredge = vi(N, -1);

		// cerr << "done\n";

		for(int i = 0; i < N; i++)
		{
			if(vis[i]) continue;
			dfs(i, -1);
		}

		// cerr << "dfs done\n";

		if(cyclic.empty()) minW[j] = 0;
		else
		{
			// cerr << "!!!!!CYCLIC DETECTED!!!!!\n";
			// cerr << "case = 2" << '\n';
			vi nwedgelist;

			int mincyclic = cyclic[0];
			for(int c : cyclic)
				mincyclic = min(mincyclic, c);

			// cerr << "1 done\n";

			for(int e : edgelist)
				if(e != mincyclic)
					nwedgelist.push_back(e);

			// cerr << "2 done\n";

			edgelist = nwedgelist;

			// cerr << "# done\n";

			// cerr << "mincyclic = " << mincyclic << '\n';

			minW[j] = W[j] + W[mincyclic];

			// cerr << "transition from " << mincyclic << " to " << j << " = " << minW[j] << "/2" << '\n';

			// cerr << "3 done\n";
		}

		// cerr << "J = " << j << " done\n";
	}

	// cerr << "check\n";
	// cerr << "\n\n\n\n\n\n\n\nPART 2 PART 2 PART 2\n";


	edgelist.clear();

	for(int j = M-1; j >= 0; j--)
	{
		// cerr << "\n\n\n\n\n\n\n";
		// cerr << "j = " << j << '\n';
		vis = vi(N, 0);

		edgelist.push_back(j);

		// cerr << "edgelist : \n";
		// for(int e : edgelist)
		// 	cerr << A[e] << ' ' << B[e] << ' ' << W[e] << '\n';

		// cerr << "###\n";
		adj = vvi(N);
		for(int e : edgelist)
		{
			adj[A[e]].push_back(e);
			adj[B[e]].push_back(e);
		}

		cyclic.clear();

		discovered = 0;

		st.clear();

		paredge = vi(N, -1);

		// cerr << "done\n";

		for(int i = 0; i < N; i++)
		{
			if(vis[i]) continue;
			dfs(i, -1);
		}

		// cerr << "dfs done\n";

		if(cyclic.empty()) maxW[j] = 2'000'000'004;
		else
		{
			// cerr << "!!!!!CYCLIC DETECTED!!!!!\n";
			// cerr << "case = 2" << '\n';
			vi nwedgelist;

			int maxcyclic = cyclic[0];
			for(int c : cyclic)
				maxcyclic = max(maxcyclic, c);

			// cerr << "1 done\n";

			for(int e : edgelist)
				if(e != maxcyclic)
					nwedgelist.push_back(e);

			// cerr << "2 done\n";

			edgelist = nwedgelist;

			// cerr << "# done\n";

			maxW[j] = W[j] + W[maxcyclic];

			// cerr << "3 done\n";
		}

		// cerr << "J = " << j << " done\n";
	}


	// for(int j = 0; j < M; j++) cerr << A[j] << ' ' << B[j] << ' ' << W[j] << " : " << minW[j] << ' ' << maxW[j] << '\n';




	int Q;
	cin >> Q;

	for(int q = 0; q < Q; q++)
	{
		ll X;
		cin >> X;

		ll res = 0;

		for(int j = 0; j < M; j++)
		{
			if(minW[j] <= 2*X && 2*X < maxW[j])
				res += abs(X - W[j]);
		}

		cout << res << '\n';
	}
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1412 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1412 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Execution timed out 5046 ms 4600 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Execution timed out 5069 ms 5148 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1412 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 2 ms 1492 KB Output is correct
20 Correct 1729 ms 16076 KB Output is correct
21 Correct 1783 ms 13896 KB Output is correct
22 Correct 1698 ms 13840 KB Output is correct
23 Correct 1783 ms 13860 KB Output is correct
24 Correct 1725 ms 13904 KB Output is correct
25 Correct 1698 ms 13976 KB Output is correct
26 Correct 1619 ms 13864 KB Output is correct
27 Correct 1679 ms 14036 KB Output is correct
28 Correct 1586 ms 13848 KB Output is correct
29 Correct 1609 ms 13796 KB Output is correct
30 Correct 1728 ms 15492 KB Output is correct
31 Correct 1652 ms 13792 KB Output is correct
32 Correct 1704 ms 14412 KB Output is correct
33 Correct 1657 ms 13736 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1412 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Execution timed out 5046 ms 4600 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1412 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Execution timed out 5046 ms 4600 KB Time limit exceeded
21 Halted 0 ms 0 KB -