oj.uz

Submission #571399

# Submission time Handle Problem Language Result Execution time Memory
571399 2022-06-02T06:49:49 Z zaneyu Chameleon's Love (JOI20_chameleon) C++14
40 / 100
 31 ms 23812 KB 
#include "chameleon.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
namespace {

int variable_example = 1;
set<int> vv[maxn];
map<pii,bool> tr;
int vis[maxn];
vector<int> cyc;
}  // namespace
void dfs(int u,int p,vector<int> &pth){
    vis[u]=1;
    pth.pb(u);
    for(int x:vv[u]){
        if(x==p) continue;
        if(!vis[x]){
            dfs(x,u,pth);
        }
        else if(vis[x]==1){
            cyc=pth;
        } 
    }
    pth.pop_back();
    vis[u]=2;
}
void Solve(int n) {
    if(n<=50){
        REP1(i,2*n){
            REP1(j,i-1){
                vector<int> v={i,j};
                if(Query(v)==1){
                    vector<int> vv;
                    REP1(k,2*n){
                        if(k==i or k==j) continue;
                        vv.pb(k);
                    }
                    if(Query(vv)<=n-1){
                        Answer(i,j);
                    } 
                }
            }
        }
    }
    else{
        for(int i=n+1;i<=2*n;i++){
            REP1(j,n){
                if(vis[j]) continue;
                vector<int> v={i,j};
                if(Query(v)==1){
                    vector<int> vv;
                    REP1(k,2*n){
                        if(k==i or k==j) continue;
                        vv.pb(k);
                    }
                    if(Query(vv)<=n-1){
                        vis[j]=1;
                        Answer(i,j);
                        break;
                    } 
                }
            }
        }
    }
}

Compilation message

chameleon.cpp:46:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   46 | int variable_example = 1;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23760 KB Output is correct
2 Correct 14 ms 23760 KB Output is correct
3 Incorrect 29 ms 23796 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 11 ms 23760 KB Output is correct
3 Correct 11 ms 23760 KB Output is correct
4 Correct 12 ms 23792 KB Output is correct
5 Correct 12 ms 23704 KB Output is correct
6 Correct 11 ms 23760 KB Output is correct
7 Correct 13 ms 23760 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 12 ms 23760 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 11 ms 23760 KB Output is correct
3 Correct 11 ms 23760 KB Output is correct
4 Correct 12 ms 23792 KB Output is correct
5 Correct 12 ms 23704 KB Output is correct
6 Correct 11 ms 23760 KB Output is correct
7 Correct 13 ms 23760 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 12 ms 23760 KB Output is correct
10 Correct 12 ms 23760 KB Output is correct
11 Correct 14 ms 23760 KB Output is correct
12 Correct 13 ms 23760 KB Output is correct
13 Correct 13 ms 23760 KB Output is correct
14 Correct 14 ms 23760 KB Output is correct
15 Correct 14 ms 23796 KB Output is correct
16 Correct 14 ms 23760 KB Output is correct
17 Correct 15 ms 23780 KB Output is correct
18 Correct 13 ms 23812 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 12 ms 23760 KB Output is correct
3 Incorrect 31 ms 23760 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23760 KB Output is correct
2 Correct 14 ms 23760 KB Output is correct
3 Incorrect 29 ms 23796 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -