入门赛F题求条,#3 RE其它全WA
  • 板块学术版
  • 楼主Karl_Wan
  • 当前回复4
  • 已保存回复4
  • 发布时间2024/12/13 22:14
  • 上次更新2024/12/14 10:02:01
查看原帖
入门赛F题求条,#3 RE其它全WA
1073879
Karl_Wan楼主2024/12/13 22:14

评测记录:https://www.luogu.com.cn/record/194294795

样例过了

#include <iostream>
#include <iomanip>
#include <set>
#include <vector>
using namespace std;
namespace my_namespace {
    long long pid[200005], tid[200005], tongguoshu[200005];
    bool state[200005], vis2[1005][2005];
    long long t, k, p, n;
    vector<long long> ac;
    vector<long long> ac2;
    vector<long long> ac4;
//set<long long> tongguo;
//long long lastAC,lastcanAC;
    int main() {
        cin >> n >> t >> p >> k;
        for (long long i = 1; i <= n; i++) {
            cin >> tid[i] >> pid[i] >> state[i];
            if (state[i]) {
                ac.push_back(tid[i]);
                if (!vis2[tid[i]][pid[i]]) {
                    ac2.push_back(tid[i]);
                    tongguoshu[tid[i]]++;
                    vis2[tid[i]][pid[i]] = 1;
                }
                if (tongguoshu[tid[i]] == 1) {
                    ac4.push_back(tid[i]);
                }
            }
        }
        long long ans3 = (-11111);
        for (long long i = ac2.size() - 1; i >= 0; i--) {
            if (tongguoshu[ac2[i]] < k) {
                ans3 = ac2[i];
            }
        }
        //long long ans4= (-22222);
//    for(long long i=ac4.size()-1;i>=0;i--)
//    {
//        ;
//    }
        cout << ac[ac.size() - 1] << ' ' << ac2[ac2.size() - 1] << ' ';
        if (ans3 != (-11111)) {
            cout << ans3 << ' ';
        }

        cout << ac4[ac4.size() - 1] << '\n';

        return 0;
    }
} int main() {
    return my_namespace::main();
}
2024/12/13 22:14
加载中...