제출 #449696

#제출 시각아이디문제언어결과실행 시간메모리
449696KhizriCalvinball championship (CEOI15_teams)C++17
10 / 100
1010 ms65540 KiB
#include <bits/stdc++.h> using namespace std; //------------------------------DEFINE------------------------------ //****************************************************************** #define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0) #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) #define endl "\n" //****************************************************************** //----------------------------FUNCTION------------------------------ //****************************************************************** ll gcd(ll a,ll b){ if(a>b) swap(a,b); if(a==0) return a+b; return gcd(b%a,a); } ll lcm(ll a,ll b){ return a/gcd(a,b)*b; } bool is_prime(ll n){ ll k=sqrt(n); if(n==2) return true; if(n<2||n%2==0||k*k==n) return false; for(int i=3;i<=k;i+=2){ if(n%i==0){ return false; } } return true; } //***************************************************************** //--------------------------MAIN-CODE------------------------------ const int mxn=2e5+5; int t=1,n; vector<int> funk(vector<int>vt,int kk){ vt.pb(kk); map<int,int>mp; int k=0; for(int i=0;i<vt.size();i++){ if(mp[vt[i]]==0){ mp[vt[i]]=++k; } vt[i]=mp[vt[i]]; } return vt; } void solve(){ cin>>n; set<vector<int>>stt,st; st.insert({1,1}); st.insert({1,2}); for(int i=3;i<=n;i++){ stt=st; st.clear(); for(vector<int>vt:stt){ for(int j=1;j<=i;j++){ st.insert(funk(vt,j)); } } } int k=0; map<vector<int>,int>mp; for(vector<int>vt:st){ mp[vt]=++k; } vector<int>v; for(int i=1;i<=n;i++){ int q; cin>>q; v.pb(q); } cout<<mp[v]<<endl; } int main(){ IOS; //cin>>t; while(t--){ solve(); } return 0; }

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

teams.cpp: In function 'std::vector<int> funk(std::vector<int>, int)':
teams.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for(int i=0;i<vt.size();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...
#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...