# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1143760 | PagodePaiva | 카니발 티켓 (IOI20_tickets) | C++20 | 15 ms | 3516 KiB |
#include<bits/stdc++.h>
#include "tickets.h"
#include <vector>
using namespace std;
const int N = 85;
vector <vector <int>> x;
int n, m, k;
int l[N], r[N];
int cnt[N];
int ans[N][N];
long long dp[N][N*N];
int best[N][N*N];
int pref[N][N];
vector <vector <int>> answer;
/*
X <= (N/2)*K
dp[N][X] = estou na linha N e quero pegar x bons
O(n*n*k*m)
*/
int query(int linha, int l, int r){
if(r < l) return 0;
if(l == 0) return pref[linha][r];
return pref[linha][r]-pref[linha][l-1];
}
void solve(){
# | 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... |