oj.uz

답안 #971116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971116 2024-04-28T02:11:13 Z THXuan Topical (NOI23_topical) C++14
0 / 100
 6 ms 23900 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

vector<pair<ll, ll>>x[1000005];

void solve()
{
	ll n, k; cin >> n >> k;
	vector<vector<ll>>v(n + 1, vector<ll>(k + 1));
	vector<vector<ll>>a(n + 1, vector<ll>(k + 1));
	int root = 0;
	for (int i = 0; i < n; i++) {
		bool flag = true;
		for (int j = 0; j < k; j++) {
			cin >> v[i][j];
			if (v[i][j] > 0)flag = false;
			x[j].push_back({ v[i][j], i });
		}
		if (flag) root = i;
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 0; i < k; i++) sort(x[i].begin(), x[i].end());
	queue<ll>q;
	q.push(root);
	ll ans = 0;
	vector<bool>visited(n, false);
	vector<ll>p(k);
	while (q.size()) {
		int node = q.front(); q.pop();
		if (visited[node])continue;
		visited[node] = true;
		++ans;
		map<ll, ll>seen;
		for (int i = 0; i < k; i++) {
			p[i] += a[node][i];
			int now = 0;
			while (now < x[i].size() && x[i][now].first <= p[i]) {
				seen[x[i][now].second]++;
				++now;
			}
		}
		for (auto u : seen) {
			if (u.second == k && !visited[u.first])q.push(u.first);
		}
	}
	cout << ans << "\n";
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;// cin>>t;
	while (t--) solve();
	return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |    while (now < x[i].size() && x[i][now].first <= p[i]) {
      |           ~~~~^~~~~~~~~~~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23896 KB Output is correct
2 Correct 6 ms 23900 KB Output is correct
3 Correct 6 ms 23900 KB Output is correct
4 Incorrect 5 ms 23900 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -