Submission #1252476

#	Time	Username	Problem	Language	Result	Execution time	Memory
1252476		Jakub_Wozniak	Festival (IOI25_festival)	C++20	5 / 100	41 ms	5564 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200009;
#define st first
#define nd second
typedef long long ll;
typedef pair<int,int> pii;
vector <pii> t[5];


std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) 
{
  int N = P.size();
  for(int i = 0; i < N ; i++)
  {
    t[T[i]].push_back({P[i],i});
  }
  for(int j = 1 ; j <= 4 ; j++)sort(t[j].begin() , t[j].end());

  vector <int> K;
  int pnt = 0;
  while(pnt < t[1].size() && (A) >= t[1][pnt].st)
  {
    A -= t[1][pnt].st;
    K.push_back(t[1][pnt].nd);
    pnt++;
  }


  return {K};
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 27
• Subtask 6: 0 / 16
• Subtask 7: 0 / 18