oj.uz

Submission #598861

# Submission time Handle Problem Language Result Execution time Memory
598861 2022-07-19T06:33:51 Z MrDeboo Cards (LMIO19_korteles) C++17
36 / 100
 1000 ms 66380 KB 
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    map<string,int>mp;
    int ans=0;
    for(int i=0;i<n;i++){
        string chr[2][2];
        for(int w=0;w<2;w++){
            for(int j=0;j<2;j++){
                char c;
                string f;
                cin>>c;
                f+=c;
                chr[w][j]=f;
            }
        }
        for(int w=1;w<(1<<4);w++){
            string g,G;
            for(int j=0;j<4;j++){
                if((1<<j)&w){
                    if(j==2)G+=chr[0][0]+chr[0][1];
                    if(j==3)G+=chr[0][1]+chr[1][1];
                    if(j==0)G+=chr[1][0]+chr[1][1];
                    if(j==1)G+=chr[0][0]+chr[1][0];
                }else G+="..";
            }
            ans+=mp[G]*(__builtin_popcount(w)%2?1:-1);
        }
        for(int w=1;w<(1<<4);w++){
            string g,G;
            for(int j=0;j<4;j++){
                if((1<<j)&w){
                    if(j==0)g+=chr[0][0]+chr[0][1];
                    if(j==1)g+=chr[0][1]+chr[1][1];
                    if(j==2)g+=chr[1][0]+chr[1][1];
                    if(j==3)g+=chr[0][0]+chr[1][0];
                }else g+="..";
            }
            mp[g]++;
        }
    }
    cout<<ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1492 KB Output is correct
7 Correct 19 ms 2016 KB Output is correct
8 Correct 32 ms 4592 KB Output is correct
9 Correct 31 ms 3828 KB Output is correct
10 Correct 29 ms 3656 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 66380 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1076 ms 63564 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 1492 KB Output is correct
3 Correct 19 ms 2016 KB Output is correct
4 Correct 32 ms 4592 KB Output is correct
5 Correct 31 ms 3828 KB Output is correct
6 Correct 29 ms 3656 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Execution timed out 1099 ms 66380 KB Time limit exceeded
13 Halted 0 ms 0 KB -