QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#780350#8674. Riddle of the Sphinxucup-team5217#WA 1ms3760kbC++232.2kb2024-11-25 10:19:092024-11-25 10:19:11

Judging History

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

  • [2024-11-25 10:19:11]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3760kb
  • [2024-11-25 10:19:09]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

double a[10][10];
double b[10][10];
map<pair<pair<double, double>, double>, int> vis; 

void solve(int i1, int i2, int i3) {
    // for (int i = 1/s)
    for (int i = 1; i <= 4; ++i) {
        a[1][i] = b[i1][i];
    }
    for (int i = 1; i <= 4; ++i) {
        a[2][i] = b[i2][i];
    }
    for (int i = 1; i <= 4; ++i) {
        a[3][i] = b[i3][i];
    }
    for (int i = 1; i <= 3; ++i) {
        // for (int j = 1; j <= )
        if (a[i][i] == 0) {
            for (int j = i + 1; j <= 3; ++j) {
                if (a[j][i]) {
                    for (int k = 1; k <= 4; ++k) {
                        swap(a[i][k], a[j][k]);
                    }
                    break;
                }
            }
        }
        for (int j = 1; j <= 3; ++j) {
            if (i == j) continue;
            double div = a[j][i] / a[i][i];
            for (int k = 1; k <= 4; ++k) {
                a[j][k] -= a[i][k] * div;
            }
        }
    }
    for (int i = 1; i <= 3; ++i) {
        a[i][4] /= a[i][i];
        // vis[make_pair(make_pair(a[1./][1], a[1][2]), a)]
    }
    vis[make_pair(make_pair(a[1][4], a[2][4]), a[3][4])]++;
}

int main() {
    cout << 1 << ' ' << 0 << ' ' << 0 << endl;
    b[1][1] = 1, b[1][2] = 0, b[1][3] = 0;
    cin >> b[1][4];
    cout << 0 << ' ' << 1 << ' ' << 0 << endl;
    b[2][1] = 0, b[2][2] = 1, b[2][3] = 0;
    cin >> b[2][4];
    cout << 0 << ' ' << 0 << ' ' << 1 << endl;
    b[3][1] = 0, b[3][2] = 0, b[3][3] = 1;
    cin >> b[3][4];
    cout << 1 << ' ' << 1 << ' ' << 1 << endl;
    b[4][1] = 1, b[4][2] = 1, b[4][3] = 1;
    cin >> b[4][4];
    cout << 1 << ' ' << 2 << ' ' << 3 << endl;
    b[5][1] = 1, b[5][2] = 2, b[5][3] = 3;
    cin >> b[5][4];
    solve(1, 2, 3);
    solve(1, 2, 4);
    solve(1, 2, 5);
    solve(1, 3, 4);
    solve(1, 3, 5);
    solve(1, 4, 5);
    solve(2, 3, 4);
    solve(2, 3, 5);
    solve(2, 4, 5);
    solve(3, 4, 5);
    for (auto it : vis) {
        if (it.second == 4) {
            cout << it.first.first.first << ' ' << it.first.first.second << ' ' << it.first.second << endl;
            return 0;
        }
    }
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3760kb

input:

1
2
3
6
14

output:

1 0 0
0 1 0
0 0 1
1 1 1
1 2 3

result:

wrong answer format  Unexpected end of file - int32 expected