oj.uz

Submission #888554

# Submission time Handle Problem Language Result Execution time Memory
888554 2023-12-17T17:42:54 Z Mr_Ph Set (COCI21_set) C++17
40 / 110
 1000 ms 65428 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<x, null_type,
ll mod=(ll)1e9+7;
ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
void preprocess() {}
void solve()
{
    int n,kk;
    cin>>n>>kk;
    vector<string>arr(n);
    ent(arr);
    int cnt=0;
    map<string,int>mp;
    for(auto i:arr)mp[i]++;
    for(int i=0;i<n;i++)
    {
        mp[arr[i]]--;
        for(int j=i+1;j<n;j++)
        {
            mp[arr[j]]--;
            string s;
            bool valid=true;
            for(int o=0;o<kk;o++)
            {
                if(arr[i][o]==arr[j][o])s+=arr[i][o];
                else 
                {
                    char x=min(arr[i][o],arr[j][o]),y=max(arr[i][o],arr[j][o]);
                    if(x=='1'&&y=='2')s+='3';
                    else if(x=='2'&&y=='3')s+='1';
                    else if(x=='1'&&y=='3')s+='2';
                }
            }
               // cout<<s<<endl;
                cnt+=mp[s];
        }
            for(int j=i+1;j<n;j++)mp[arr[j]]++;
    }
    cout<<cnt<<endl;
}
signed main()
{
    // freopen("meta_game_input.txt","r",stdin);
    // freopen("otput.txt","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    int t=1,st;
   // cin>>t;
    while(t--)
        solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:13:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
Main.cpp:24:5: note: in expansion of macro 'ent'
   24 |     ent(arr);
      |     ^~~
Main.cpp:35:18: warning: unused variable 'valid' [-Wunused-variable]
   35 |             bool valid=true;
      |                  ^~~~~
Main.cpp: In function 'int main()':
Main.cpp:62:13: warning: unused variable 'st' [-Wunused-variable]
   62 |     int t=1,st;
      |             ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 7 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 9 ms 468 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 472 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 7 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 9 ms 468 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 472 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 818 ms 676 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 800 ms 676 KB Output is correct
24 Correct 55 ms 640 KB Output is correct
25 Correct 790 ms 680 KB Output is correct
26 Correct 7 ms 856 KB Output is correct
27 Correct 753 ms 676 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 7 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 9 ms 468 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 472 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 818 ms 676 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 800 ms 676 KB Output is correct
24 Correct 55 ms 640 KB Output is correct
25 Correct 790 ms 680 KB Output is correct
26 Correct 7 ms 856 KB Output is correct
27 Correct 753 ms 676 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Execution timed out 1062 ms 65428 KB Time limit exceeded
35 Halted 0 ms 0 KB -