oj.uz

답안 #636069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
636069 2022-08-27T23:04:50 Z groshi Cards (LMIO19_korteles) C++17
0 / 100
 1000 ms 33632 KB 
#include<iostream>
#include<map>
#include<vector>
using namespace std;
map< pair<char,char>,int >mn; //gora
map< pair<char,char>,int >ms; //dol
map< pair<char,char>,int >mw; //lewo
map< pair<char,char>,int >me; //prawo
map< pair< pair<int,int>,pair<int,int> >,int >m;
vector< pair< pair<char,char>,pair<char,char> > >v;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
    int n,v1,v2,v3,v4,sum=0;
    string s1,s2;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>s1>>s2;
        v1=s1[0];
        v2=s1[1];
        v3=s2[0];
        v4=s2[1];
        m[{{v1,v2},{v3,v4}}]=1;
        mn[{v1,v2}]++;
        ms[{v3,v4}]++;
        mw[{v1,v3}]++;
        me[{v2,v4}]++;
        v.push_back({{v1,v2},{v3,v4}});
    }
    for(int i=0;i<n;i++){
        v1=v[i].first.first;
        v2=v[i].first.second;
        v3=v[i].second.first;
        v4=v[i].second.second;
        sum+=mn[{v3,v4}];
        sum+=mw[{v2,v4}];
        sum+=ms[{v1,v2}];
        sum+=me[{v1,v3}];
        sum-=m[{{v3,v4},{v1,v2}}];
        sum-=m[{{v2,v4},{v1,v3}}];
        if(v2==v1&&v3==v4)sum-=2;
        if(v1==v3&&v2==v4)sum-=2;
    }
    cout<<sum/2;
    return 0;
}

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1080 ms 33632 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 121 ms 9036 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -