Submission #228664

# Submission time Handle Problem Language Result Execution time Memory
228664 2020-05-02T09:56:55 Z osaaateiasavtnl Poi (IOI09_poi) C++14
60 / 100
314 ms 12152 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]);        
    }   
    cout << place + 1 << endl;
}
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 512 KB Output isn't correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 22 ms 512 KB Output is correct
7 Incorrect 5 ms 512 KB Output isn't correct
8 Correct 5 ms 512 KB Output is correct
9 Incorrect 6 ms 640 KB Output isn't correct
10 Correct 8 ms 768 KB Output is correct
11 Correct 15 ms 1152 KB Output is correct
12 Incorrect 21 ms 1792 KB Output isn't correct
13 Incorrect 55 ms 3064 KB Output isn't correct
14 Correct 75 ms 3960 KB Output is correct
15 Incorrect 125 ms 5624 KB Output isn't correct
16 Correct 143 ms 6240 KB Output is correct
17 Incorrect 193 ms 8056 KB Output isn't correct
18 Correct 222 ms 9080 KB Output is correct
19 Correct 297 ms 11412 KB Output is correct
20 Correct 314 ms 12152 KB Output is correct