oj.uz

답안 #1055280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055280 2024-08-12T16:20:59 Z lovrot Islands (IOI08_islands) C++17
80 / 100
 418 ms 131072 KB 
#include <cstdio> 
#include <vector>
#include <algorithm> 
#include <set>

#define debug(...) //fprintf(stderr, __VA_ARGS__)
#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 1e6 + 10;

int n, weg[N]; 
vector<pii> g[N];

char bio[N];
vector<pii> cyc;

int dfs(int u, int p) { 
	bio[u] = 1;
	for(pii e : g[u]) { 
		int v = e.X, w = e.Y;
		if(w != p) { 
			if(bio[v]) { 
				cyc.PB({e.X, weg[e.Y]});
				return v;
			} else {
				int res = dfs(v, w);
				if(res) { 
					cyc.PB({e.X, weg[e.Y]});
					return res != u ? res : 0;
				}
			}
		}
	}
	bio[u] = 0;
	return 0;
}

void mark(int u) { 
	bio[u] = 2;
	for(pii e : g[u]) { 
		if(bio[e.X] != 2) { 
			mark(e.X);
		}
	}
}

ll dep[N], ans_;

ll depth(int u, int p) { 
	ll max_ = 0;
	for(pii e : g[u]) { 
		int v = e.X, w = e.Y;
		if(w != p && !bio[v]) { 
			ll res = (ll) weg[w] + depth(v, w);
			if(dep[u] < res) { 
				max_ = dep[u]; 
				dep[u] = res;
			} else if(max_ < res) { 
				max_ = res;
			}
		}
	}
	ans_ = max(ans_, dep[u] + max_);
	return dep[u];
}

multiset<ll> s;

int main() { 
	scanf("%d", &n);

	for(int i = 1; i <= n; ++i) { 
		int u;
		scanf("%d%d", &u, weg + i);
		g[i].PB({u, i});
		g[u].PB({i, i});
	}

	ll ans = 0;
	for(int i = 1; i <= n; ++i) { 
		if(bio[i]) { continue; }

		cyc.clear();
		s.clear();
		ans_ = 0;
		dfs(i, 0);

		for(pii e : cyc) { 
			depth(e.X, 0);
			debug("%d(%d, %lld)\n", e.X, e.Y, dep[e.X]);
		}

		mark(i);

		ll prf = 0;
		for(pii e : cyc) { 
			int v = e.X, w = e.Y;	
			s.insert(dep[v] + prf);
			prf += w;
		}

		ll prf_ = 0, len = prf;
		for(pii e : cyc) {
			int v = e.X, w = e.Y;
			s.erase(s.find(dep[v] + prf - len));

			ans_ = max(ans_, *prev(s.end()) + dep[v] - prf + len);

			s.insert(dep[v] + prf);
			prf += w;
		}

		ans += ans_;
	}

	printf("%lld\n", ans);
	return 0;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:109:6: warning: unused variable 'prf_' [-Wunused-variable]
  109 |   ll prf_ = 0, len = prf;
      |      ^~~~
islands.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
islands.cpp:81:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |   scanf("%d%d", &u, weg + i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

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

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 27224 KB Output is correct
2 Correct 3 ms 26972 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 26972 KB Output is correct
2 Correct 4 ms 27484 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 27996 KB Output is correct
2 Correct 16 ms 30812 KB Output is correct
3 Correct 9 ms 27996 KB Output is correct
4 Correct 6 ms 27556 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 32116 KB Output is correct
2 Correct 33 ms 34008 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 38868 KB Output is correct
2 Correct 77 ms 46284 KB Output is correct
3 Correct 107 ms 60620 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 47956 KB Output is correct
2 Correct 148 ms 81600 KB Output is correct
3 Correct 262 ms 87232 KB Output is correct
4 Correct 270 ms 116148 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 156 ms 68524 KB Output is correct
2 Runtime error 418 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 199 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -