oj.uz

답안 #669337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
669337 2022-12-06T09:13:51 Z berr The Potion of Great Power (CEOI20_potion) C++17
17 / 100
 765 ms 138600 KB 
#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][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;

}/*
int main() {
  int N, D, U, Q;
  std::ios::sync_with_stdio(false); std::cin.tie(NULL);
  std::cin >> N >> D >> U >> Q;

  int *F = new int[N];
  for (int i=0; i<N; i++)
    std::cin >> F[i];
  init(N, D, F);

  int *A = new int[U], *B = new int[U];
  for (int i=0; i<U; i++) {
    std::cin >> A[i] >> B[i];
  }
  curseChanges(U, A, B);

  bool correct = true;
  for (int i=0; i<Q; i++) {
    int X,Y,V,CorrectAnswer;
    std::cin >> X >> Y >> V >> CorrectAnswer;
    int YourAnswer = question(X,Y,V);
    if (YourAnswer != CorrectAnswer) {
      std::cout << "WA! Question: " << i
		<< " (X=" << X << ", Y=" << Y << ", V=" << V << ") "
		<<  "Your answer: " << YourAnswer
                << " Correct Answer: " << CorrectAnswer << std::endl;
      correct = false;
    } else {
      std::cerr << YourAnswer << " - OK" << std::endl;
    }
  }

  if (correct) {
    std::cout << "Correct." << std::endl;
  } else std::cout << "Incorrect." << std::endl;
  return 0;
}*/

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:81:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     if(posx >= st[x].size() || posy <= 0 || st[x][posx] > v) return 1e9;
      |        ~~~~~^~~~~~~~~~~~~~~
potion.cpp:82:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     if(posy >= st[y].size() || posy <= 0 || st[y][posy] > v) return 1e9;
      |        ~~~~~^~~~~~~~~~~~~~~
potion.cpp:87:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     while(lx<sx.size() && sx[lx]==0) lx++;
      |           ~~^~~~~~~~~~
potion.cpp:88:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     while(ly<sy.size() && sy[ly]==0) ly++;
      |           ~~^~~~~~~~~~
potion.cpp:92:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     while(lx<sx.size() && ly < sy.size()){
      |           ~~^~~~~~~~~~
potion.cpp:92:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     while(lx<sx.size() && ly < sy.size()){
      |                           ~~~^~~~~~~~~~~
potion.cpp:100:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
  100 |             while(lx<sx.size() && sx[lx]==0) lx++;
      |                   ~~^~~~~~~~~~
potion.cpp:104:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
  104 |             while(ly<sy.size() && sy[ly]==0) ly++;
      |                   ~~^~~~~~~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7248 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7888 KB Output is correct
2 Correct 6 ms 7800 KB Output is correct
3 Correct 7 ms 7888 KB Output is correct
4 Correct 29 ms 19540 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 765 ms 96868 KB Output is correct
2 Correct 704 ms 96900 KB Output is correct
3 Runtime error 194 ms 112772 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 676 ms 96644 KB Output is correct
2 Runtime error 351 ms 138600 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 12624 KB Output is correct
2 Correct 76 ms 11520 KB Output is correct
3 Incorrect 14 ms 10724 KB Incorrect
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7248 KB Output is correct
2 Correct 6 ms 7888 KB Output is correct
3 Correct 6 ms 7800 KB Output is correct
4 Correct 7 ms 7888 KB Output is correct
5 Correct 29 ms 19540 KB Output is correct
6 Correct 765 ms 96868 KB Output is correct
7 Correct 704 ms 96900 KB Output is correct
8 Runtime error 194 ms 112772 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -