oj.uz

Submission #863818

# Submission time Handle Problem Language Result Execution time Memory
863818 2023-10-21T07:42:04 Z AtabayRajabli Poi (IOI09_poi) C++17
100 / 100
 166 ms 31868 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

// author : AtabeyR

#define pb          push_back
#define pii         pair<int, int>
#define pll         pair<ll, ll>
#define all(v)      v.begin(), v.end()
#define OPT         ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sec         second
#define fi          first
#define int         ll
#define print(k)    cerr << "Ans : "; cout << k << endl;
#define ins         insert
#define bpc         __builtin_popcountll
#define skip        continue
#define endll        '\n'
#define gcd(a, b)   __gcd(a, b)
#define lcm(a, b)   a*b / (__gcd(a, b))

typedef long long ll;
typedef unsigned long long ull;
const int oo = 0x3F3F3F3F;
const int ooo = 0x3F3F3F3F3F3F3F3FLL;
const int mod = 998244353;
const int sz = 2005;
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

void open(string s)
{
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

int n, m, t, p, a[sz][sz], s[sz];

bool cmp(array<int, 3> a, array<int, 3> b)
{
    if(a[0] != b[0])return a[0] > b[0];
    if(a[1] != b[1])return a[1] > b[1];
    return a[2] < b[2];
}

void solve()
{
    cin >> n >> t >> p;

    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=t; j++)
        {
            cin >> a[i][j];
            s[j] += (a[i][j] == 0);
        }
    }

    vector<array<int, 3>> v;
    
    for(int i = 1; i<=n; i++)
    {
        int po = 0, ts = 0;
        for(int j = 1; j<=t; j++)po += s[j] * a[i][j], ts += a[i][j];
        v.pb({po, ts, i});
    }

    sort(all(v), cmp);
    int r = 1;
    for(array<int, 3> x : v)
    {
        if(x[2] == p)
        {
            cout << x[0] << " " << r << endll;
            return;
        }
        else r++;
    }
}

int32_t main()
{
    // open("i");

    OPT
    int t = 1;
    //cin >> t;

    for(int i = 1; i<=t; i++)
        solve();
}

Compilation message

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

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 6 ms 6684 KB Output is correct
12 Correct 10 ms 8732 KB Output is correct
13 Correct 34 ms 12880 KB Output is correct
14 Correct 36 ms 16976 KB Output is correct
15 Correct 64 ms 21084 KB Output is correct
16 Correct 72 ms 21076 KB Output is correct
17 Correct 99 ms 25200 KB Output is correct
18 Correct 113 ms 27244 KB Output is correct
19 Correct 149 ms 31828 KB Output is correct
20 Correct 166 ms 31868 KB Output is correct