Submission #388789

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
388789	2021-04-13T03:06:48 Z	arwaeystoamneg	Poi (IOI09_poi)	C++17	100 / 100	317 ms	15948 KB

poi

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353  
const ld pi = 3.1415926535;

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
int n, m, p;
vector<vi>a;
vi b, c;

int main()
{
	setIO("");


	cin >> n >> m >> p;
	a.rsz(n, vi(m));
	F0R(i, n)F0R(j, m)cin >> a[i][j];
	vi v(m, n);
	F0R(i, n)
	{
		F0R(j, m)
		{
			if (a[i][j])v[j]--;
		}
	}
	b.rsz(n);
	c.rsz(n);
	F0R(i, n)
	{
		F0R(j, m)
		{
			if (a[i][j])b[i] += v[j], c[i]++;
		}
	}
	vi order(n);
	iota(all(order), 0);
	sort(all(order), [](int i, int j) {
		if (b[i] == b[j])
		{
			if (c[i] == c[j])
			{
				return i < j;
			}
			return c[i] > c[j];
		}
		return b[i] > b[j];
		});
	cout << b[p - 1] << " ";
	cout << find(all(order), p - 1) - order.begin() + 1 << endl;
}

Compilation message

poi.cpp: In function 'void setIO(std::string)':
poi.cpp:49:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poi.cpp:51:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	3 ms	332 KB	Output is correct
11	Correct	10 ms	796 KB	Output is correct
12	Correct	16 ms	1124 KB	Output is correct
13	Correct	47 ms	2644 KB	Output is correct
14	Correct	67 ms	3672 KB	Output is correct
15	Correct	122 ms	6220 KB	Output is correct
16	Correct	128 ms	6604 KB	Output is correct
17	Correct	188 ms	9764 KB	Output is correct
18	Correct	217 ms	10956 KB	Output is correct
19	Correct	282 ms	14468 KB	Output is correct
20	Correct	317 ms	15948 KB	Output is correct