oj.uz

답안 #669323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
669323 2022-12-06T08:58:25 Z berr The Potion of Great Power (CEOI20_potion) C++17
0 / 100
 623 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+30;
vector<string> sts[N];
vector<array<int, 2>> adj[N];
vector<int> h, st[N];
map<array<int, 2>, int> mp;
string s;



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

    for(int i=0; i<d; i++){
        s+='0';
    }

    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];

        string 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);

        swap(x, y);

        ss=sts[x].back();
        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);

    }
}


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

   /* int posx = lower_bound(st[x].begin(), st[x].end(), v)-st[x].begin()-1;
    int posy = lower_bound(st[y].begin(), st[y].end(), v)-st[y].begin()-1;
*/

    int posx=0, posy=0;

    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;

    string sx = sts[x][posx], sy=sts[y][posy];
    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:43: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]
   43 |         for(int l=0; l<adj[i].size(); l++){
      |                      ~^~~~~~~~~~~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:83:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     if(posx >= st[x].size() || posy <= 0 || st[x][posx] > v) return 1e9;
      |        ~~~~~^~~~~~~~~~~~~~~
potion.cpp:84:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     if(posy >= st[y].size() || posy <= 0 || st[y][posy] > v) return 1e9;
      |        ~~~~~^~~~~~~~~~~~~~~
potion.cpp:89:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     while(lx<sx.size() &&
      |           ~~^~~~~~~~~~
potion.cpp:91:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     while(ly<sy.size() && sy[ly]=='0') ly++;
      |           ~~^~~~~~~~~~

Subtask #1
0 / 0.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 623 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 604 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

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

Subtask #6
0 / 30.0

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