제출 #345062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345062		casperwang	열대 식물원 (Tropical Garden) (IOI11_garden)	C++14	0 / 100	830 ms	1388 KiB

garden

#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
#define All(x) x.begin(), x.end()
#define pb emplace_back
#define pii pair<int,int>
#define ppi pair<pii,int>
#define ff first
#define ss second
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 150000;
const int MAXQ = 2000;

void count_routes(int N, int M, int P, int R[MAXN][2], int Q, int G[MAXQ]) {
  vector<vector<ppi>> path(N);
  for (int i = 0; i < M; i++) {
    path[R[i][0]].pb(pii(0, i), R[i][1]);
    path[R[i][1]].pb(pii(0, i), R[i][0]);
  }
  vector <pii> K(Q);
  for (int i = 0; i < Q; i++) {
    K[i].ff = G[i];
    K[i].ss = i;
  }
  sort(All(K));
  vector <int> ans(N);
  for (int i = 0; i < N; i++) {
    debug("now", i);
    for (int j = 0; j < N; j++) {
      for (int k = 0; k < path[j].size(); k++) {
        path[j][k].ff.ff = 0;
      }
    }
    int cur = i;
    int now = 0;
    for (int q = 0; q < Q; q++) {
      while (now < K[q].ff) {
        sort(All(path[cur]));
        path[cur][0].ff.ff++;
        cur = path[cur][0].ss;
        debug(cur);
        now++;
      }
      if (cur == P) ans[K[q].ss]++;
    }
  }
  for (int q = 0; q < Q; q++) {
  debug(ans[q]);
    answer(ans[q]);
  }
  return;
}

컴파일 시 표준 에러 (stderr) 메시지

garden.cpp: In function 'void count_routes(int, int, int, int (*)[2], int, int*)':
garden.cpp:35:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |       for (int k = 0; k < path[j].size(); k++) {
      |                       ~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 49
• Subtask 2: 0 / 20
• Subtask 3: 0 / 31