제출 #931813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931813		Syrius	Topical (NOI23_topical)	C++14	12 / 100	1047 ms	110612 KiB

Main

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;

#define int long long
#define ll long long
#define ff first
#define ss second
#define pint pair < int , int >
#define fast ios_base::sync_with_stdio(NULL); cin.tie(NULL)

const int inf = 1e9 + 9;
const int mxn = 2e5 + 2;
const int mod = 1e9 + 7;

vector < vector < int > > u , r;
int n , k;

bool cmp(vector < int > a , vector < int > b) {
    for (int i = 0; i < k; i++) {
        if (a[i] < b[i]) return 1;
        else if (a[i] > b[i]) return 0;
    }
    return 0;
}

signed main() {

    cin >> n >> k;

    for (int i = 0; i < n; i++) {
        vector < int > tv;
        for (int j = 0; j < k; j++) {
            int t;
            cin >> t;
            tv.push_back(t);
        }
        tv.push_back(i);
        r.push_back(tv);
    }

    u.resize(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            int t;
            cin >> t;
            u[i].push_back(t);
        }
    }

    sort(r.begin() , r.end() , cmp);
    vector < int > p(k , 0);

    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (!cmp(p , r[i])) {
            ans++;
            for (int j = 0; j < k; j++) {
                p[j] += u[r[i][k]][j];
            }
        } else break;
    }

    cout << ans << '\n';
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 28
• Subtask 3: 0 / 21
• Subtask 4: 0 / 39