# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1163965 | AlgorithmWarrior | 카니발 티켓 (IOI20_tickets) | C++20 | 395 ms | 61284 KiB |
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>answer;
vector<deque<int>>mat;
vector<int>st;
vector<int>dr;
long long alege(int id){
int n=mat.size();
vector<bool>ans(n,0);
int i,j;
long long rasp=0;
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(mat[j].back()<mat[i][0]){
++cntm;
summ+=mat[i][0]-mat[j][0];
util[j]=0;
}
else
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |