oj.uz

Submission #364145

# Submission time Handle Problem Language Result Execution time Memory
364145 2021-02-08T09:56:24 Z knightron0 Carnival Tickets (IOI20_tickets) C++14
16 / 100
 659 ms 53484 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double
#define lli long long int

const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;

lli find_maximum(int k, vector<vector<int>> x){
	int n = (int)x.size();
	int m = (int)x[0].size();
	vector<pair<int, int>> vec;
	vector<vector<int>> s;
	for(int i= 0;i<n;i++){
		vec.pb({x[i][0]+x[i][m-1], i});
		vector<int> tmp(m, -1);
		s.pb(tmp);
	}
	sort(all(vec));
	lli ans = 0;
	for(int i= 0;i<n/2;i++){
		ans -= (lli)x[vec[i].sc][0];
		s[vec[i].sc][0] = 0;
		s[vec[i].sc][m-1] = -1;
	}
	for(int i= n/2;i<n;i++){
		ans += (lli)x[vec[i].sc][m-1];
		s[vec[i].sc][0] = -1;
		s[vec[i].sc][m-1] = 0;
	}
	allocate_tickets(s);
	return ans;
}

// signed main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(NULL);
//     #ifdef LOCAL
//     freopen("input.txt", "r", stdin);
//     #endif
//     int n, m;
//     cin>>n>>m;
//     vector<vector<int>> a;
//     for(int i= 0;i<n;i++){
//     	vector<int> tmp;
//     	for(int j= 0;j<m;j++){
//     		int t1;
//     		cin>>t1;
//     		tmp.pb(t1);
//     	}
//     	a.pb(tmp);
//     }
//     cout<<find_maximum(0, a)<<endl;
//     return 0;
// }

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 524 KB Output is correct
5 Correct 27 ms 3308 KB Output is correct
6 Correct 659 ms 53484 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -