QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#395482#7070. Isomerismsuibian_xiaozhao#WA 57ms3800kbC++231.5kb2024-04-21 15:09:552024-04-21 15:09:56

Judging History

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

  • [2024-04-21 15:09:56]
  • 评测
  • 测评结果:WA
  • 用时:57ms
  • 内存:3800kb
  • [2024-04-21 15:09:55]
  • 提交

answer

#include "bits/stdc++.h"

using namespace std;

#define endl "\n"
#define debug(x)  cerr <<#x<<" "<<x<<endl;
using ll = long long;
#define int ll
struct node {
    int ma, mi, va;
};
const int inf = -1e18;

//{-F,-Cl,-Br,-I,-CH3,-CH2CH3,-CH2CH2CH3,-H}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    vector<string> v = {"-F", "-Cl", "-Br", "-I",
                        "-CH3", "-CH2CH3", "-CH2CH2CH3", "-H"};


    map<string, int> mp;
    for (int i = 0; i < v.size(); i++) {
        mp[v[i]] = i + 1;
        debug(v[i]);
    }
    while (n--) {
        string s1, s2, s3, s4;
        cin >> s1 >> s2 >> s3 >> s4;
        set<string> s;
        s.emplace(s1);
        s.emplace(s2);
        s.emplace(s3);
        s.emplace(s4);
        assert(mp.count(s1));
        assert(mp.count(s2));
        assert(mp.count(s3));
        assert(mp.count(s4));

        if (s1 == s3
        || s2 == s4)
            cout << "None" << endl;
        else if (s.size() != 4) {
            if (s1 == s2 || s3 == s4)
                cout << "Cis" << endl;
            else
                cout << "Trans" << endl;
        } else {
            if ((mp[s1] > mp[s3]) != (mp[s2] > mp[s3])) {
                cout << "Zasamman" << endl;
            } else {
                cout << "Entgegen" << endl;
            }
        }
    }

}
// 2 -H -H -H -Cl -F -F -Br -Cl
//1 -F -F -Cl -Cl
//1 -F  -Cl -Cl -F

// -F -Cl -Br  -I
// -Br -F -Cl    -I

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
-H -H -H -Cl
-F -F -Br -Cl

output:

None
Cis

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 57ms
memory: 3800kb

input:

100000
-Br -CH3 -H -CH2CH2CH3
-CH3 -I -Cl -Cl
-CH3 -Br -CH2CH3 -CH3
-H -CH3 -Cl -CH3
-H -F -CH2CH3 -CH2CH2CH3
-Br -Br -Cl -CH2CH2CH3
-F -Cl -H -CH2CH2CH3
-CH2CH2CH3 -CH3 -CH3 -H
-CH2CH2CH3 -CH3 -CH2CH2CH3 -Br
-CH3 -Cl -CH2CH2CH3 -CH3
-H -CH2CH3 -I -I
-CH3 -Cl -Br -I
-I -Cl -H -F
-CH2CH2CH3 -Cl -Br -...

output:

Entgegen
Cis
Trans
None
Zasamman
Cis
Entgegen
Trans
None
Trans
Cis
Zasamman
Entgegen
Cis
Cis
Entgegen
Trans
None
Cis
None
Cis
None
None
Entgegen
Cis
None
Zasamman
Zasamman
None
None
Cis
Trans
Entgegen
Entgegen
Entgegen
Trans
Entgegen
None
Entgegen
Trans
Cis
Trans
Entgegen
Trans
None
Entgegen
None
Tr...

result:

wrong answer 1st lines differ - expected: 'Zasamman', found: 'Entgegen'