Submission #304430

#TimeUsernameProblemLanguageResultExecution timeMemory
304430urd05카니발 티켓 (IOI20_tickets)C++14
11 / 100
2 ms768 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using namespace std; long long dp[81][6400]; const long long INF=1e16; long long find_maximum(int k, vector<vector<int>> v) { int n = v.size(); int m = v[0].size(); vector<vector<int>> answer(n,vector<int>(m)); vector<int> temp; for(int i=0;i<n;i++) { temp.push_back(v[i][0]); answer[i][0]=0; for(int j=1;j<m;j++) { answer[i][j]=-1; } } sort(temp.begin(),temp.end()); long long ret=0; for(int i=0;i<n/2;i++) { ret-=temp[i]; } for(int i=n/2;i<n;i++) { ret+=temp[i]; } allocate_tickets(answer); return ret; }
#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...