oj.uz

Submission #126763

# Submission time Handle Problem Language Result Execution time Memory
126763 2019-07-08T11:16:56 Z mechfrog88 Olympiads (BOI19_olympiads) C++14
13 / 100
 13 ms 1528 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
using namespace __gnu_pbds;
using namespace std;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;
 
vector <vector<ll>> arr;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n,k,c;
	cin >> n >> k >> c;
	arr.resize(n,vector<ll>(k));
	for (int z=0;z<n;z++){
		for (int x=0;x<k;x++){
			cin >> arr[z][x];
		}
	}
	if (k == 1){
		ll ans = 0;
		vector <ll> lol;
		for (int z=0;z<n;z++){
			ll temp = 0;
			for (int x=0;x<k;x++){
				temp += arr[z][x];
			}
			lol.push_back(temp);
		}
		sort(lol.rbegin(),lol.rend());
		cout << lol[c-1] << endl;
	} else if (k == 2){
		vector <ll> lol;
		for (int z=0;z<n;z++){
			vector <ll> temp(k);
			for (int x=0;x<k;x++){
				temp[x] = arr[z][x];
			}
			for (int q=z+1;q<n;q++){
				ll c = 0;
				for (int x=0;x<k;x++){
					c += max(temp[x],arr[q][x]);
				}
				lol.push_back(c);
			}
		}
		sort(lol.rbegin(),lol.rend());
		cout << lol[c-1] << endl;
	}
}

Compilation message

olympiads.cpp: In function 'int main()':
olympiads.cpp:30:6: warning: unused variable 'ans' [-Wunused-variable]
   ll ans = 0;
      ^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1520 KB Output is correct
2 Correct 11 ms 1524 KB Output is correct
3 Correct 9 ms 1528 KB Output is correct
4 Correct 6 ms 1524 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1520 KB Output is correct
2 Correct 11 ms 1524 KB Output is correct
3 Correct 9 ms 1528 KB Output is correct
4 Correct 6 ms 1524 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -