제출 #248770

#제출 시각아이디문제언어결과실행 시간메모리
248770promaT-Covering (eJOI19_covering)C++17
70 / 100
972 ms102404 KiB
#include <bits/stdc++.h> #define endl "\n" #define see(x) cerr<<#x<<"="<<x<<endl; using namespace std; const int32_t N = 1002; int m, n, val[N*N], ans, k, cnt; bool spec[N*N], used[N*N]; map <pair <int, int>, int> def; vector <int> g[N*N], values; void dfs (int v) { used[v] = true; if (spec[v]) ++ cnt; else values.push_back(val[v]); for (auto i: g[v]) if (!used[i]) dfs(i); } int32_t main () { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> m >> n; int temp = 1; for (int i = 0; i < m; ++ i) for (int j = 0; j < n; ++ j) { int a; cin >> a; val[temp] = a; def[{i, j}] = temp ++; } cin >> k; for (int i = 0; i < k; ++ i) { int x, y; cin >> x >> y; int t = def[{x,y}], t1 = def[{x-1,y}], t2 = def[{x,y-1}], t3 = def[{x+1,y}], t4 = def[{x,y+1}]; ans += val[t]; spec[t] = true; if (x) { g[t].push_back(t1); g[t1].push_back(t); } if (y) { g[t].push_back(t2); g[t2].push_back(t); } if (x < m-1) { g[t].push_back(t3); g[t3].push_back(t); } if (y < n-1) { g[t].push_back(t4); g[t4].push_back(t); } } temp = 1; for (int i = 0; i < m; ++ i) for (int j = 0; j < n; ++ j) { if (!used[temp]) { values.clear(); cnt = 0; dfs(temp); sort(values.rbegin(), values.rend()); if (3*cnt > values.size()) { cout << "No\n"; return 0; } for (int k = 0; k < 3*cnt; ++ k) ans += values[k]; } ++ temp; } cout << ans << endl; return 0; }

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

covering.cpp: In function 'int32_t main()':
covering.cpp:30:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = 0; i < m; ++ i)
     ^~~
covering.cpp:37:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     cin >> k;
     ^~~
covering.cpp:75:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if (3*cnt > values.size()) {
            ~~~~~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...