답안 #669339

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
669339	2022-12-06T09:16:56 Z	berr	The Potion of Great Power (CEOI20_potion)	C++17	0 / 100	757 ms	112812 KB

potion

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+30;
vector<bitset<504>> sts[N];
vector<array<int, 2>> adj[N];
vector<int> h, st[N];
map<array<int, 2>, int> mp;
bitset<504> s;



void init(int n, int d, int H[]){

    for(int i=0; i<n; i++){
        sts[i].push_back(s);
        st[i].push_back(-1);
    }

    for(int i=0; i<n; i++){
        h.push_back(H[i]);
    }


}

void curseChanges(int u, int a[], int b[]){
    for(int i=0; i<u; i++){
        adj[a[i]].push_back({h[b[i]], b[i]});
        adj[b[i]].push_back({h[a[i]], a[i]});
    }

    for(int i=0; i<N; i++){
        sort(adj[i].begin(), adj[i].end());
    }


   for(int i=0; i<N; i++){
        for(int l=0; l<adj[i].size(); l++){
            mp[{i, adj[i][l][1]}]=l;
        }
    }

    for(int i=0; i<u; i++){
        int x=a[i], y=b[i];

        bitset ss=sts[x].back();
        
        int pos=mp[{x, y}];
        if(ss[pos]==1) ss[pos]=0;
        else ss[pos]=1; 

        sts[x].push_back(ss);
        st[x].push_back(i);


        ss=sts[y].back();
        pos=mp[{y, x}];

        if(ss[pos]==1) ss[pos]=0;
        else ss[pos]=1; 

        sts[y].push_back(ss);
        st[y].push_back(i);

    }
}


int question(int x, int y, int v){

   /* int posx=-1, posy=-1;

    if(st[x].size())
    posx = lower_bound(st[x].begin(), st[x].end(), v)-st[x].begin()-1;
    
    if(st[y].size())
    posy = lower_bound(st[y].begin(), st[y].end(), v)-st[y].begin()-1;



    if(posx >= st[x].size() || posy <= 0 || st[x][posx] > v) return 1e9;
    if(posy >= st[y].size() || posy <= 0 || st[y][posy] > v) return 1e9;*/



    bitset sx = sts[x].back(), sy=sts[y].back();
    int lx=0, ly=0;
      
    while(lx<sx.size() && sx[lx]==0) lx++;
    while(ly<sy.size() && sy[ly]==0) ly++;

    int ans=1e9;

    while(lx<sx.size() && ly < sy.size()){
        int vx=adj[x][lx][0];
        int vy=adj[y][ly][0];

        ans=min(ans, abs(vx-vy));

        if(vx < vy){
            lx ++;
            while(lx<sx.size() && sx[lx]==0) lx++;
        }
        else if(vx > vy){
            ly ++;
            while(ly<sy.size() && sy[ly]==0) ly++;
        }
        else{
            break;
        }
    }

    return ans;

}

Compilation message

potion.cpp: In function 'void curseChanges(int, int*, int*)':
potion.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for(int l=0; l<adj[i].size(); l++){
      |                      ~^~~~~~~~~~~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:89:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     while(lx<sx.size() && sx[lx]==0) lx++;
      |           ~~^~~~~~~~~~
potion.cpp:90:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     while(ly<sy.size() && sy[ly]==0) ly++;
      |           ~~^~~~~~~~~~
potion.cpp:94:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     while(lx<sx.size() && ly < sy.size()){
      |           ~~^~~~~~~~~~
potion.cpp:94:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     while(lx<sx.size() && ly < sy.size()){
      |                           ~~~^~~~~~~~~~~
potion.cpp:102:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
  102 |             while(lx<sx.size() && sx[lx]==0) lx++;
      |                   ~~^~~~~~~~~~
potion.cpp:106:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
  106 |             while(ly<sy.size() && sy[ly]==0) ly++;
      |                   ~~^~~~~~~~~~

Subtask #1
0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	7248 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	6 ms	7888 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	757 ms	96896 KB	Output is correct
2	Correct	713 ms	96844 KB	Output is correct
3	Runtime error	196 ms	112812 KB	Execution killed with signal 6
4	Halted	0 ms	0 KB	-