QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#766478#9246. Dominating PointssmallC233#WA 468ms28164kbC++202.3kb2024-11-20 17:27:532024-11-20 17:27:53

Judging History

你现在查看的是最新测评结果

  • [2024-11-22 18:38:25]
  • hack成功,自动添加数据
  • (/hack/1238)
  • [2024-11-20 17:27:53]
  • 评测
  • 测评结果:WA
  • 用时:468ms
  • 内存:28164kb
  • [2024-11-20 17:27:53]
  • 提交

answer

#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define int long long
using namespace std;
#define pii pair<int, int>
const int MAX = 5e3;
const int N = MAX + 10;
const int INF = 1e18, MOD = 998244353;

int n;
bool a[N][N];
int out[N];
vector<int> my_out;

void find_max_out() {
    int p, max_out = 0;
    for (int i = 1; i <= n; i++) {
        if (out[i] > max_out) {
            max_out = out[i];
            p = i;
        }
    }
    my_out.push_back(p);
}

inline void solve() {
    cin >> n;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            char ch;
            cin >> ch;
            if (ch == '0') {
                a[i][j] = 0;
            } else {
                a[i][j] = 1;
                out[i]++;
            }
        }
    }

    // 1
    find_max_out();

    // 2
    int p = my_out[0];
    vector<int> v;
    for (int i = 1; i <= n; i++) {
        if (i == p) continue;
        if (a[p][i] == 0)
            v.push_back(i);
    }
    if (v.empty()) {
        cout << "NOT FOUND\n";
        return;
    }

    for (int i = 1; i <= n; i++) {
        out[i] = 0;
    }
    for (int x : v) {
        for (int i = 1; i <= n; i++) {
            if (a[x][i] == 1) {
                out[x]++;
            }
        }
    }
    find_max_out();

    // 3
    p = my_out[1];
    v.clear();
    for (int i = 1; i <= n; i++) {
        if (i == p) continue;
        if (a[p][i] == 0)
            v.push_back(i);
    }
    if (v.empty()) {
        cout << "NOT FOUND\n";
        return;
    }

    for (int i = 1; i <= n; i++) {
        out[i] = 0;
    }
    for (int x : v) {
        for (int i = 1; i <= n; i++) {
            if (a[x][i] == 1) {
                out[x]++;
            }
        }
    }
    find_max_out();

    for (int x : my_out) {
        cout << x << " ";
    }
    cout << "\n";
}

signed main() {
#ifdef Local
    freopen("D:/vs/in.txt", "r", stdin);
    // freopen("D:/vs/out.txt","w",stdout);
    clock_t start_time = clock();
#else
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
#endif  // Local
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
#ifdef Local
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3592kb

input:

6
011010
000101
010111
100001
010100
100010

output:

3 1 4 

result:

ok OK, Answer correct.

Test #2:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

3
011
001
000

output:

NOT FOUND

result:

ok OK, Answer correct.

Test #3:

score: 0
Accepted
time: 1ms
memory: 3544kb

input:

3
010
001
100

output:

1 3 2 

result:

ok OK, Answer correct.

Test #4:

score: 0
Accepted
time: 460ms
memory: 28096kb

input:

4994
0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...

output:

1505 153 870 

result:

ok OK, Answer correct.

Test #5:

score: 0
Accepted
time: 451ms
memory: 28092kb

input:

4994
0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...

output:

4094 756 4574 

result:

ok OK, Answer correct.

Test #6:

score: 0
Accepted
time: 468ms
memory: 28164kb

input:

4995
0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...

output:

86 2421 1046 

result:

ok OK, Answer correct.

Test #7:

score: 0
Accepted
time: 456ms
memory: 28152kb

input:

4998
0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...

output:

3642 13 3850 

result:

ok OK, Answer correct.

Test #8:

score: 0
Accepted
time: 467ms
memory: 28148kb

input:

4994
0010111010011101101110001111100011010010010000101101110110110000100010000101011100000001011100010001000011010101011111100011010000010110000011110010011000101011100011110110011101110000101100111110000110100111001101000100011001001001100001101110001100111011100111001011001011010111111001001000010...

output:

4591 2950 523 

result:

ok OK, Answer correct.

Test #9:

score: -100
Wrong Answer
time: 0ms
memory: 3672kb

input:

1
0

output:

2 2 2 

result:

wrong answer Token parameter [name=useranswer1] equals to "2", doesn't correspond to pattern "[A-Z]{3,3}"