oj.uz

Submission #449917

# Submission time Handle Problem Language Result Execution time Memory
449917 2021-08-02T09:35:52 Z BT21tata Calvinball championship (CEOI15_teams) C++17
20 / 100
 655 ms 65540 KB 
#include<bits/stdc++.h>
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
using namespace std;
const ll MOD=1e9+7;
// mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
 
int n, a[10004], x, ans;
set<vector<int> >s;
vector<int>v;

void f(vector<int>a)
{
    if(a.size()==n)
    {
        s.insert(a);
        return;
    }
    int mx=0;
    for(int u : a) mx=max(mx, u);
    for(int i=1; i<=mx+1; i++)
    {
        a.pb(i);
        f(a);
        a.pop_back();
    }
}

int main()
{
    SPEED;
    cin>>n;
    for(int i=0; i<n; i++)
        cin>>x, v.pb(x);
    vector<int>a;
    a.pb(1);
    f(a);
    for(auto it=s.begin(); it!=s.end(); ++it)
    {
        ans++;
        if(v==(*it)) break;
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

teams.cpp: In function 'void f(std::vector<int>)':
teams.cpp:29:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |     if(a.size()==n)
      |        ~~~~~~~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 454 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 655 ms 65540 KB Execution killed with signal 9

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 607 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 519 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 499 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 48 ms 65540 KB Execution killed with signal 9

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -