oj.uz

답안 #253991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
253991 2020-07-29T08:37:13 Z nabilervatra Cards (LMIO19_korteles) C++14
100 / 100
 503 ms 70392 KB 
#include <bits/stdc++.h>

#define pb push_back
using namespace std;
int n,satu,dua,empat,u,d,l,r;
vector<int > pairu[459977],paird[459977],pairr[459977],pairl[459977];
bool tmp1[680],tmp2[680],tmp3[680],tmp4[680];
bool ada[459977];
string s[459977],abaw,tms1,tms2,kaki,tms,a,b;
int hsh(string a){
    return int(a[0]-'A')*   676*26+int(a[1]-'A')*676+int(a[2]-'A')*26+int(a[3]-'A');
}
void ts(string &x, char a, char b, char c , char d){
    
    x.pb(a);
    x.pb(b);
    x.pb(c);
    x.pb(d);
}
int main(){
    cin>>n;
    for(int i =1;i<=n;i++){
        a,b;
        cin>>a>>b;
        s[i] = a+b;
        u = (s[i][0]-'A')*26+ (s[i][1]-'A');
        d = (s[i][2]-'A')*26+ (s[i][3]-'A');
        l = (s[i][0]-'A')*26+ (s[i][2]-'A');
        r = (s[i][1]-'A')*26+ (s[i][3]-'A');
        pairu[u].pb(d);
        paird[d].pb(u);
        pairl[l].pb(r);
        pairr[r].pb(l);
        ada[hsh(s[i])]=1;
    }
    for(int i =0;i<26*26;i++){
        satu+= pairu[i].size()*paird[i].size();
        memset(tmp1,0,sizeof(tmp1));
        memset(tmp2,0,sizeof(tmp2));
        memset(tmp3,0,sizeof(tmp3));
        memset(tmp4,0,sizeof(tmp4));

        for(auto j :pairu[i])tmp1[j]=1;
        for(auto j :paird[i])tmp2[j]=1;
        if(tmp1[i]&&tmp2[i])satu--;
        satu+= pairl[i].size()*pairr[i].size();
        for(auto j :pairl[i])tmp3[j]=1;
        for(auto j :pairr[i])tmp4[j]=1;
        if(tmp3[i]&&tmp4[i])satu--;
    }
    // cout<<satu<<endl;
    for(int i =1;i<=n;i++){
        abaw="";
        ts(abaw,s[i][2],s[i][3],s[i][0],s[i][1]);
        // cout<<abaw<<endl;
        kaki="";
        ts(kaki,s[i][1],s[i][0],s[i][3],s[i][2]);
        if(s[i]!=abaw&&ada[hsh(abaw)])dua++;
        if(s[i]!=kaki&&ada[hsh(kaki)])dua++;
        if(s[i][0]==s[i][3]&&s[i][2]==s[i][1]){
            tms = "";
            ts(tms, s[i][1],s[i][0],s[i][3],s[i][2]);
            if(s[i]!=tms&&ada[hsh(tms)])empat++;
        }
        if(s[i][1]==s[i][2]){
            for(char j = 'A' ;j<='Z';j++){
                 tms1="";
                 ts(tms1,j,s[i][0],s[i][0],s[i][1]);
                 tms2 = "";
                 ts(tms2,s[i][1],s[i][3],s[i][3],j);
                if(s[i]!=tms1&&ada[hsh(tms1)])dua++;
                if(s[i]!=tms2&&ada[hsh(tms2)])dua++;
            }
        }
        if(s[i][0]==s[i][3]){
            for(char j = 'A' ;j<='Z';j++){
                tms1 ="";
                ts(tms1,s[i][1],j,s[i][0],s[i][1]);
                tms2 = "";
                ts(tms2,s[i][2],s[i][0],j,s[i][2]);
                if(s[i]!=tms1&&ada[hsh(tms1)])dua++;
                if(s[i]!=tms2&&ada[hsh(tms2)])dua++;
            }
        }
    }
    // cout<<dua<<' '<<empat<<endl;
    cout<<satu- dua/2 + (empat/2)*3<<endl;
}

Compilation message

korteles.cpp: In function 'int main()':
korteles.cpp:23:11: warning: left operand of comma operator has no effect [-Wunused-value]
         a,b;
           ^
korteles.cpp:23:12: warning: right operand of comma operator has no effect [-Wunused-value]
         a,b;
            ^

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 57932 KB Output is correct
2 Correct 40 ms 57984 KB Output is correct
3 Correct 36 ms 57976 KB Output is correct
4 Correct 36 ms 58112 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 57976 KB Output is correct
2 Correct 38 ms 58360 KB Output is correct
3 Correct 39 ms 58104 KB Output is correct
4 Correct 45 ms 58616 KB Output is correct
5 Correct 45 ms 58496 KB Output is correct
6 Correct 40 ms 58488 KB Output is correct
7 Correct 35 ms 57976 KB Output is correct
8 Correct 38 ms 57932 KB Output is correct
9 Correct 40 ms 57984 KB Output is correct
10 Correct 36 ms 57976 KB Output is correct
11 Correct 36 ms 58112 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 70332 KB Output is correct
2 Correct 503 ms 70392 KB Output is correct
3 Correct 476 ms 70392 KB Output is correct
4 Correct 475 ms 70264 KB Output is correct
5 Correct 473 ms 70264 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 57976 KB Output is correct
2 Correct 82 ms 59768 KB Output is correct
3 Correct 279 ms 64120 KB Output is correct
4 Correct 187 ms 63864 KB Output is correct
5 Correct 190 ms 63780 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 57976 KB Output is correct
2 Correct 38 ms 58360 KB Output is correct
3 Correct 39 ms 58104 KB Output is correct
4 Correct 45 ms 58616 KB Output is correct
5 Correct 45 ms 58496 KB Output is correct
6 Correct 40 ms 58488 KB Output is correct
7 Correct 35 ms 57976 KB Output is correct
8 Correct 38 ms 57932 KB Output is correct
9 Correct 40 ms 57984 KB Output is correct
10 Correct 36 ms 57976 KB Output is correct
11 Correct 36 ms 58112 KB Output is correct
12 Correct 496 ms 70332 KB Output is correct
13 Correct 503 ms 70392 KB Output is correct
14 Correct 476 ms 70392 KB Output is correct
15 Correct 475 ms 70264 KB Output is correct
16 Correct 473 ms 70264 KB Output is correct
17 Correct 82 ms 59768 KB Output is correct
18 Correct 279 ms 64120 KB Output is correct
19 Correct 187 ms 63864 KB Output is correct
20 Correct 190 ms 63780 KB Output is correct
21 Correct 153 ms 61356 KB Output is correct
22 Correct 383 ms 68860 KB Output is correct
23 Correct 273 ms 64376 KB Output is correct
24 Correct 271 ms 64376 KB Output is correct