제출 #472179

#제출 시각아이디문제언어결과실행 시간메모리
472179Mr_PhZamjena (COCI18_zamjena)C++14
14 / 70
20 ms1980 KiB
///made by : Mr_Ph :D #include<bits/stdc++.h> #include<unordered_map> typedef long long ll; typedef long long int lli; typedef unsigned long long ull; using namespace std; const double PI=acos(-1.0); const ll mod=(ll)1e9+7; //int a1[4] = {0, 0, 1, -1}; //int b1[4] = {1, -1, 0, 0}; ///the defines :) #define endl '\n' #define vi vector<int> #define vll vector<ll> #define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower) #define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper) #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() ///the end of the defines ;) map<string,vector<string>>adj; map<string,bool>vs; map<string,string>mp; bool isint(string s) { for(int i=0;i<s.sz;i++) { if(s[i]<'0'||s[i]>'9') return false; } return true; } vector<string>aa; void dfs(string node) { if(isint(node)) aa.push_back(node); vs[mp[node]]=true; for(auto i:adj[mp[node]]) if(!vs[i]) dfs(i); } void solve() { int n; cin>>n; vector<string>arr(n); vector<string>brr(n); for(int i=0; i<n; i++) { cin>>arr[i]; mp[arr[i]]=arr[i]; } for(int i=0;i<n;i++) { cin>>brr[i]; mp[brr[i]]=brr[i]; } for(int i=0;i<n;i++) { vs.clear(); if(isint(mp[arr[i]])&&isint(mp[brr[i]])) { if(mp[arr[i]]!=mp[brr[i]]) { cout<<"NE"<<endl; return; } } else { if(isint(mp[arr[i]])) dfs(mp[brr[i]]); else dfs(mp[arr[i]]); if(aa.sz>1) { cout<<"NE"<<endl; return; } } } // for(int i=0;i<n;i++) //{ // if(mp[arr[i]]!=mp[brr[i]]) // { // cout<<"NE"<<endl; // return; // } // } cout<<"DA"<<endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); //freopen("window.in","r",stdin); //freopen("output.txt","w",stdout); int t=1;//int st; //cin>>t;//cin>>st; while(t--) solve(); }

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

zamjena.cpp: In function 'bool isint(std::string)':
zamjena.cpp:28:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i=0;i<s.sz;i++)
      |                  ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...