Submission #1238623

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238623		santi3223	Catfish Farm (IOI22_fish)	C++20	0 / 100	49 ms	8776 KiB

fish

#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
#define ll long long
#define vl vector<ll>
#define all(aaa) aaa.begin(), aaa.end()
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vb vector<bool>
#define ed "\n"
#define pb push_back

long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y, std::vector<int> W){
	if(n == 1){
		return 0;
	}
	vl a(n, 0), b(n, 0);
	ff(i, 0, m){
		//cout << "X[i]" << " " << Y[i] << " " << W[i] << " ";
		if(X[i] == 0){
			//cout << "A";
			a[Y[i]] = W[i];
		}
		else{
			//cout << "B";
			b[Y[i]] = W[i];
		}
		//cout << ed;
	}
	ll c = 0;
	ff(i, 0, n){
		c += max(a[i], b[i]);
	}
	return c;
}
/*
int main() {
  int N, M;
  assert(2 == scanf("%d %d", &N, &M));

  std::vector<int> X(M), Y(M), W(M);
  for (int i = 0; i < M; ++i) {
    assert(3 == scanf("%d %d %d", &X[i], &Y[i], &W[i]));
  }

  long long result = max_weights(N, M, X, Y, W);
  printf("%lld\n", result);
  return 0;
}
*/

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16