제출 #345373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345373		_zheksenov	결혼 문제 (IZhO14_marriage)	C++14	64 / 100	1598 ms	2284 KiB

marriage

#include <bits/stdc++.h>

using namespace std;

signed main() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int> > g;
    g.resize(n + 2);
    for (int i = 0; i < k; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
    }
    int ans = 0;
    for (int l = 1; l <= n; l++) { 
        set<int> s;
        int cnt = 0;
        for (int r = l; r <= n; r++) {
            for (auto to : g[r])
                s.insert(to);
            if (g[r].empty())
                cnt++;
            int length = r - l + 1;
            if (s.size() == m && s.size() <= length - cnt) { 
                ans++;
            }
        }
    }
    cout << ans << "\n";
    return 0;
}

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

marriage.cpp: In function 'int main()':
marriage.cpp:25:26: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |             if (s.size() == m && s.size() <= length - cnt) {
      |                 ~~~~~~~~~^~~~
marriage.cpp:25:43: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |             if (s.size() == m && s.size() <= length - cnt) {
      |                                  ~~~~~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 64 / 100