Submission #228666

# Submission time Handle Problem Language Result Execution time Memory
228666 2020-05-02T09:59:24 Z osaaateiasavtnl Poi (IOI09_poi) C++14
100 / 100
334 ms 4344 KB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 2007;
int n, t, p;
int cost[N];
bool a[N][N];
int sum[N], cnt[N];

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    cin >> n >> t >> p;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < t; ++j) {
            cin >> a[i][j];
            cnt[i] += a[i][j];
            if (!a[i][j])
                ++cost[j];
        }
    }   
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < t; ++j)
            if (a[i][j])
                sum[i] += cost[j];    
    }   
    --p;
    cout << sum[p] << ' ';
    int place = 0;
    for (int i = 0; i < n; ++i) {
        place += (mp(sum[i], cnt[i]) > mp(sum[p], cnt[p])) || (mp(sum[i], cnt[i]) == mp(sum[p], cnt[p]) && i < p);        
    }   
    cout << place + 1 << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 8 ms 768 KB Output is correct
11 Correct 14 ms 896 KB Output is correct
12 Correct 20 ms 1280 KB Output is correct
13 Correct 52 ms 1784 KB Output is correct
14 Correct 76 ms 2424 KB Output is correct
15 Correct 129 ms 2772 KB Output is correct
16 Correct 137 ms 2936 KB Output is correct
17 Correct 197 ms 3320 KB Output is correct
18 Correct 211 ms 3704 KB Output is correct
19 Correct 277 ms 4344 KB Output is correct
20 Correct 334 ms 4344 KB Output is correct