Submission #395095

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
395095	2021-04-27T18:24:27 Z	MarcoMeijer	Poi (IOI09_poi)	C++14	100 / 100	359 ms	23876 KB

poi

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 3000;
const int N = (1<<20);

int n, t, p;
int gr[MX][MX];
int sa[MX], points[MX], contPoints[MX], contSolved[MX];

void program() {
    IN(n,t,p); p--;
    RE(i,n) RE(j,t) IN(gr[i][j]);

    // fill points
    RE(i,t) points[i] = 0;
    RE(i,n) contPoints[i] = 0, contSolved[i] = 0;
    RE(i,n) RE(j,t) if(!gr[i][j]) points[j]++;
    RE(i,n) RE(j,t) if( gr[i][j]) contPoints[i] += points[j], contSolved[i]++;

    // sort them
    RE(i,n) sa[i] = i;
    sort(sa,sa+n,[](int i, int j) {
        if(contPoints[i] != contPoints[j]) return contPoints[i] > contPoints[j];
        if(contSolved[i] != contSolved[j]) return contSolved[i] > contSolved[j];
        return i < j;
    });
    
    // find ans
    RE(i,n) if(sa[i] == p) OUTLS(contPoints[p],i+1);
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	2 ms	588 KB	Output is correct
8	Correct	1 ms	588 KB	Output is correct
9	Correct	2 ms	716 KB	Output is correct
10	Correct	3 ms	1228 KB	Output is correct
11	Correct	10 ms	1996 KB	Output is correct
12	Correct	19 ms	3112 KB	Output is correct
13	Correct	48 ms	5444 KB	Output is correct
14	Correct	69 ms	7648 KB	Output is correct
15	Correct	120 ms	10984 KB	Output is correct
16	Correct	130 ms	11844 KB	Output is correct
17	Correct	192 ms	15620 KB	Output is correct
18	Correct	214 ms	17724 KB	Output is correct
19	Correct	288 ms	22396 KB	Output is correct
20	Correct	359 ms	23876 KB	Output is correct