結果
問題 | No.709 優勝可能性 |
ユーザー | ミドリムシ |
提出日時 | 2018-06-29 23:06:35 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 495 ms / 3,500 ms |
コード長 | 3,078 bytes |
コンパイル時間 | 734 ms |
コンパイル使用メモリ | 77,016 KB |
実行使用メモリ | 10,932 KB |
最終ジャッジ日時 | 2023-09-13 15:35:58 |
合計ジャッジ時間 | 5,785 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 244 ms
4,896 KB |
testcase_11 | AC | 170 ms
4,376 KB |
testcase_12 | AC | 390 ms
7,144 KB |
testcase_13 | AC | 354 ms
8,268 KB |
testcase_14 | AC | 316 ms
8,540 KB |
testcase_15 | AC | 294 ms
8,316 KB |
testcase_16 | AC | 281 ms
8,520 KB |
testcase_17 | AC | 284 ms
10,932 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 495 ms
8,528 KB |
testcase_21 | AC | 494 ms
8,428 KB |
testcase_22 | AC | 1 ms
4,376 KB |
testcase_23 | AC | 2 ms
4,376 KB |
ソースコード
#include <iostream> #include <algorithm> #include <vector> #include <string.h> #include <numeric> using namespace std; template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; } template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; } template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; } template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; } template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; } int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; } long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }} struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); } template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; } template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; } #define mod long(1e9 + 7) #define all(x) (x).begin(), (x).end() #define bitcount(n) __builtin_popcountl(long(n)) int main(){ int N, M; cin >> N >> M; int R[N][M]; for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ cin >> R[i][j]; } } bool can_win[N][M]; memset(can_win, false, sizeof(can_win)); vector<int> maximum(M, 0); vector<int> winner[M]; int ans = 0; for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ if(maximum[j] < R[i][j]){ maximum[j] = R[i][j]; for(int k = 0; k < winner[j].size(); k++){ can_win[winner[j][k]][j] = false; ans -= !accumulate(can_win[winner[j][k]], can_win[winner[j][k]] + M, 0); } winner[j] = {i}; ans += !accumulate(can_win[i], can_win[i] + M, 0); can_win[i][j] = true; maximum[j] = R[i][j]; }else if(maximum[j] == R[i][j]){ winner[j].push_back(i); ans += !accumulate(can_win[i], can_win[i] + M, 0); can_win[i][j] = true; } } cout << ans << endl; } }