제출 #693161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
693161		NemanjaSo2005	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	4 ms	6676 KiB

tickets

#include<bits/stdc++.h>
#include "tickets.h"
#define ll long long
using namespace std;
int N,M,K,koliko[1505][1505];
struct slog{
   int vred,i,j;
}niz[1505];
bool pov(slog a,slog b){
   return a.vred<b.vred;
}
vector<vector<int>> kako;
ll find_maximum(int k,vector<vector<int>> d){
   kako=d;
   for(int i=0;i<kako.size();i++)
      for(int j=0;j<kako[i].size();j++)
         kako[i][j]=-1;
   K=k;
   N=d.size();
   M=d[0].size();
   for(int i=1;i<=N;i++)
      for(int j=1;j<=M;j++)
         koliko[i][j]=d[i-1][j-1];
   if(M==1){
      for(int i=1;i<=N;i++){
         niz[i].vred=koliko[i][1];
         niz[i].i=i-1;
         niz[i].j=1-1;
      }
      sort(niz+1,niz+1+N,pov);
      ll res=0;
      for(int i=1;i<=N/2;i++){
         res-=niz[i].vred;
        // cout<<"- "<<niz[i].vred<<endl;
         kako[niz[i].i][niz[i].j]=0;
      }
      for(int i=N/2+1;i<=N;i++){
         //cout<<"+ "<<niz[i].vred<<endl;
         kako[niz[i].i][niz[i].j]=0;
         res+=niz[i].vred;
      }
      //cout<<res<<endl;
      allocate_tickets(kako);
      return res;
   }
}

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

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:15:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |    for(int i=0;i<kako.size();i++)
      |                ~^~~~~~~~~~~~
tickets.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |       for(int j=0;j<kako[i].size();j++)
      |                   ~^~~~~~~~~~~~~~~
tickets.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
   46 | }
      | ^

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10