제출 #1163944

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1163944	2025-03-08 17:11:39	AlgorithmWarrior	카니발 티켓 (IOI20_tickets)	C++20	27 / 100	372 ms	51492 KiB

tickets

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k,vector<vector<int>>x){
  int n = x.size();
  int m = x[0].size();
    int i,j;
    long long sum=0;
    vector<vector<int>>answer;
    vector<bool>ans(n,0);
    for(i=0;i<n;++i){
        vector<int>row;
        for(j=0;j<m;++j)
            row.push_back(-1);
        answer.push_back(row);
    }
    for(i=0;i<n;++i){
        int cntm=0,cntM=0;
        long long summ=0,sumM=0;
        long long summij=0;
        vector<pair<int,int>>mij;
        vector<bool>util(n,1);
        util[i]=0;
        for(j=0;j<n;++j)
        if(i!=j){
            if(x[j].back()<x[i][0]){
                ++cntm;
                summ+=x[i][0]-x[j][0];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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