제출 #616013

#제출 시각아이디문제언어결과실행 시간메모리
616013yanndev카니발 티켓 (IOI20_tickets)C++17
0 / 100
0 ms212 KiB
#include "tickets.h"
#include <vector>
using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	if (m == 1) {
		vector<vector<int>> answer;
		for (int i = 0; i < n; i++) {
			vector<int> row (m);
			for (int j = 0; j < m; j++) {
				if (j < k) {
					row[j] = j;
				} else {
					row[j] = -1;
				}
			}
			
			answer.push_back(row);
		}
		allocate_tickets(answer);
		return 1;
	}
}

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

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
   26 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...