oj.uz

Submission #420645

# Submission time Handle Problem Language Result Execution time Memory
420645 2021-06-08T13:06:19 Z zaneyu Monster Game (JOI21_monster) C++17
98 / 100
 157 ms 1636 KB 
/*input
2
4
bbcb
aada
aada
3
abc
bbb
bbb

*/
#include "monster.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#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) (ll)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e17;
const int INF=0x3f3f3f3f;
const ll MOD2=3006703054056749LL;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#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)
ll mult(ll a,ll b){
	ll res=0;
	while(b){
		if(b&1) res+=a,res%=MOD;
		a+=a;
		a%=MOD; 
		b>>=1;
	}
	return res;
}
ll mypow(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1) res=mult(res,a);
		a=mult(a,a);
		b/=2;
	}
	return res;
}
int tmp[maxn],arr[maxn];
map<pii,bool> mp;
bool cmp(int a,int b){
    if(mp.count({a,b})) return mp[{a,b}];
    mp[{a,b}]=Query(a,b);
    mp[{b,a}]=1-mp[{a,b}];
    return mp[{a,b}];
}
void srt(int l,int r){
    if(l==r) return;
    int mid=(l+r)/2;
    srt(l,mid);
    srt(mid+1,r);
    int p1=l,p2=mid+1,p=l;
    while(p1<=mid and p2<=r){
        if(cmp(arr[p1],arr[p2])) tmp[p++]=arr[p1++];
        else tmp[p++]=arr[p2++];
    }
    while(p1<=mid) tmp[p++]=arr[p1++];
    while(p2<=r) tmp[p++]=arr[p2++];
    for(int i=l;i<=r;i++) arr[i]=tmp[i]; 
}
vector<int> Solve(int n) {
    REP(i,n) arr[i]=i;
    srt(0,n-1);
    //REP(i,n) cout<<arr[i]<<' ';
    vector<int> ans(n);
    vector<int> v;
    REP1(i,n-1){
        if(!cmp(arr[0],arr[i])){
            v.pb(i);
        }
    }
    int mx=0;
    if(sz(v)==1){
        if(cmp(arr[1],arr[v[0]])){
            if(v[0]==2){
                mx=0;
                for(int i=3;i<n;i++){
                	if(!cmp(arr[1],arr[i])) break;
                    if(!cmp(arr[2],arr[i])){
                        mx=1;
                        break;
                    }
                }
            }
            else mx=1;
        }
        else{
            mx=0;
        }
    }
    else{
        mx=v[sz(v)-2];
    }
    int cur=n-1;
    for(int i=mx;i>=0;i--){
        ans[arr[i]]=(cur--);
    }
    int p=0;
    v.clear();
    for(int i=mx+1;i<n;i++){
        v.pb(i);
        if(!cmp(arr[p],arr[i])){
            reverse(ALL(v));
            p=v.back();
            for(auto x:v) ans[arr[x]]=(cur--);
            v.clear();        
        }
    }
    //for(auto x:ans) cout<<x<<' ';
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 19 ms 376 KB Output is correct
17 Correct 24 ms 384 KB Output is correct
18 Correct 14 ms 460 KB Output is correct
19 Correct 25 ms 444 KB Output is correct
20 Correct 20 ms 424 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 14 ms 328 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 300 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 13 ms 312 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 19 ms 376 KB Output is correct
17 Correct 24 ms 384 KB Output is correct
18 Correct 14 ms 460 KB Output is correct
19 Correct 25 ms 444 KB Output is correct
20 Correct 20 ms 424 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 14 ms 328 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 300 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 13 ms 312 KB Output is correct
33 Correct 104 ms 1572 KB Output is correct
34 Correct 139 ms 1636 KB Output is correct
35 Correct 131 ms 1564 KB Output is correct
36 Correct 104 ms 1516 KB Output is correct
37 Correct 109 ms 1460 KB Output is correct
38 Correct 100 ms 1460 KB Output is correct
39 Correct 146 ms 1540 KB Output is correct
40 Correct 123 ms 1532 KB Output is correct
41 Correct 144 ms 1544 KB Output is correct
42 Correct 129 ms 1548 KB Output is correct
43 Correct 96 ms 1028 KB Output is correct
44 Correct 69 ms 992 KB Output is correct

Subtask #3
73.0 / 75.0

# Verdict Execution time Memory Grader output
1 Partially correct 112 ms 1600 KB Partially correct
2 Partially correct 112 ms 1524 KB Partially correct
3 Partially correct 132 ms 1488 KB Partially correct
4 Partially correct 114 ms 1468 KB Partially correct
5 Partially correct 157 ms 1556 KB Partially correct
6 Correct 82 ms 1368 KB Output is correct
7 Correct 76 ms 1340 KB Output is correct
8 Partially correct 101 ms 1492 KB Partially correct
9 Partially correct 129 ms 1552 KB Partially correct
10 Partially correct 144 ms 1576 KB Partially correct
11 Partially correct 129 ms 1552 KB Partially correct
12 Partially correct 95 ms 1452 KB Partially correct
13 Correct 89 ms 1364 KB Output is correct
14 Correct 82 ms 1328 KB Output is correct
15 Correct 77 ms 1000 KB Output is correct
16 Correct 85 ms 988 KB Output is correct
17 Correct 78 ms 1096 KB Output is correct
18 Correct 129 ms 1436 KB Output is correct