제출 #1125498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1125498		zNatsumi	메기 농장 (IOI22_fish)	C++20	3 / 100	72 ms	10860 KiB

fish

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5,
          M = 3e5 + 5;

int n, m;
struct info{
  int x, y, w;
  info(){}
  info(int x, int y, int w): x(x), y(y), w(w) {}
} fish[M];

namespace sub1{
  long long solve(){
    long long res = 0LL;
    for(int i = 0; i < m; i++) res += fish[i].w;
    return res;
  }
}

int64_t max_weights(int _N, int _M, vector<int> _X, vector<int> _Y, vector<int> _W){
  n = _N; m = _M;
  for(int i = 0; i < m; i++) fish[i] = info(_X[i], _Y[i], _W[i]);

  bool flag1 = true;
  for(int i = 0; i < m; i++) if(fish[i].x & 1){ flag1 = false; break; }

  if(flag1) return sub1::solve();
  return 0;
}

//#define zNatsumi
#ifdef zNatsumi

int32_t main(){
  cin.tie(0)->sync_with_stdio(0);
  #define task "test"
  if(fopen(task ".inp", "r")){
    freopen(task ".inp", "r", stdin);
    freopen(task ".out", "w", stdout);
  }
  int n, m; cin >> n >> m;
  vector<int> x(m), y(m), w(m);
  for(int i = 0; i < m; i++) cin >> x[i] >> y[i] >> w[i];

  cout << max_weights(n, m, x, y, w);
}

#endif

• Subtask 1: 3 / 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