제출 #1282148

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1282148		ducanh0811	Railway (BOI17_railway)	C++20	0 / 100	18 ms	2684 KiB

railway

#include <bits/stdc++.h>
bool M1;
#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define REV(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
using namespace std;

#define MAXN 100005
int n, m, k; 
pair<int, int> a[MAXN];
int cnt[MAXN];


///++++++++++++++++++++++++++++++++++++++///

void solve() {
    cin >> n >> m >> k; 
    FOR(i, 1, n) {
        int l, r; cin >> l >> r;
        a[i] = {l, r};
    }
    FOR(i, 1, m) { 
        int k; cin >> k; 
        FOR(j, 1, k) { 
            int x; cin >> x; 
            cnt[x]++; 
        }
    }
    vector<int> ans; 
    FOR(i, 1, n) { 
        if (cnt[i] >= k) ans.push_back(i); 
    }
    cout << ans.size() << '\n';
    for (int &x : ans) cout << x << ' ';
}

///++++++++++++++++++++++++++++++++++++++///

#define task "test"
int32_t main() {
    if (fopen(task".inp","r")) {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    solve();
    bool M2;
    cerr << "++++++++++++++++++++++++++++\n";
    cerr << "Time: " << clock() << "ms" << '\n';
    cerr << "Memory: " << abs(&M2 - &M1) / 1024 / 1024 << "MB" << '\n';
    cerr << "++++++++++++++++++++++++++++\n";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

railway.cpp: In function 'int32_t main()':
railway.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
railway.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 7
• Subtask 4: 0 / 29
• Subtask 5: 0 / 16
• Subtask 6: 0 / 25