# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935926 | Litusiano | Cards (LMIO19_korteles) | C++17 | 1091 ms | 36568 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define s second
#define f first
int check1(vector<char> a, vector<char> b){
int ans = 0;
if(a[0] == b[3] && a[1] == b[4]) ans++;
if(a[0] == b[2] && a[2] == b[4]) ans++;
if(a[1] == b[1] && a[3] == b[3]) ans++;
if(a[2] == b[1] && a[3] == b[2]) ans++;
return ans;
}
vector<char> find(vector<char> v){
vector<char> k(4,' ');
k[3-1] = v[1]; k[4-1] = v[2];
k[0] = v[3]; k[2-1] = v[4];
if(check1(k,v) == 4) return k;
return {};
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin>>n;
map<pair<char,char>,int> m12,m13,m34,m24;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |