oj.uz

Submission #444639

# Submission time Handle Problem Language Result Execution time Memory
444639 2021-07-14T13:32:35 Z FEDIKUS Poi (IOI09_poi) C++17
100 / 100
 333 ms 23812 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

const int maxn=2010;
int resilo[maxn];
int brp[maxn];
int ulaz[maxn][maxn];
int uradio[maxn];

void solve(){
    int n,t,p;
    cin>>n>>t>>p;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=t;j++){
            cin>>ulaz[i][j];
            if(ulaz[i][j]){
                resilo[j]++;
                uradio[i]++;
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=t;j++){
            if(ulaz[i][j]) brp[i]+=n-resilo[j];
        }
    }
    int koji=1;
    for(int i=1;i<=n;i++){
        if(brp[i]==brp[p]){
            if(uradio[i]==uradio[p]){
                koji+=i<p;
            }else koji+=uradio[i]>uradio[p];
        }else koji+=brp[i]>brp[p];
    }
    cout<<brp[p]<<" "<<koji;
}

int main(){
    ios;
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 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 1 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 11 ms 2172 KB Output is correct
12 Correct 18 ms 3420 KB Output is correct
13 Correct 53 ms 6596 KB Output is correct
14 Correct 71 ms 9292 KB Output is correct
15 Correct 123 ms 12580 KB Output is correct
16 Correct 136 ms 13680 KB Output is correct
17 Correct 200 ms 16760 KB Output is correct
18 Correct 225 ms 19008 KB Output is correct
19 Correct 298 ms 23108 KB Output is correct
20 Correct 333 ms 23812 KB Output is correct