제출 #888550

#제출 시각아이디문제언어결과실행 시간메모리
888550Mr_PhSet (COCI21_set)C++17
0 / 110
6 ms348 KiB
#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]; } } 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(); }

컴파일 시 표준 에러 (stderr) 메시지

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:61:13: warning: unused variable 'st' [-Wunused-variable]
   61 |     int t=1,st;
      |             ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...