oj.uz

Submission #949878

# Submission time Handle Problem Language Result Execution time Memory
949878 2024-03-19T19:36:40 Z fuad27 Alternating Current (BOI18_alternating) C++17
13 / 100
 1544 ms 2348 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
long double P(int old, int nw, long double temp) {
  if(nw < old)return 1.0;
  return exp((old-nw)/temp);

}
vector<int> mask;
vector<pair<int,int>> a;
int n, m;
int eval() {
  int cnt1[n+1], cnt2[n+1];
  memset(cnt1, 0, sizeof cnt1);
  memset(cnt2, 0, sizeof cnt2);
  for(int i = 0;i<m;i++) {
    if(mask[i]) {
      if(a[i].second>=a[i].first) {
        cnt1[a[i].first]++;
        cnt1[a[i].second+1]--;
      }
      else {
        cnt1[a[i].first]++;
        cnt1[0]++;
        cnt1[a[i].second+1]--;
      }
    }
    else {
      if(a[i].second>=a[i].first) {
        cnt2[a[i].first]++;
        cnt2[a[i].second+1]--;
      }
      else {
        cnt2[a[i].first]++;
        cnt2[0]++;
        cnt2[a[i].second+1]--;
      }
    }
  }
  for(int i = 1;i<=n;i++) {
    cnt1[i]+=cnt1[i-1];
    cnt2[i]+=cnt2[i-1];
  }
  int cc=0;
  for(int i = 0;i<n;i++) {
    if(cnt1[i]<=0 or cnt2[i]<=0)cc++;
  }
  return cc;
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  auto start=clock();
  mask.resize(m);
  a.resize(m);
  for(int i = 0;i<m;i++){
    cin >> a[i].first >> a[i].second;
    a[i].first--;
    a[i].second--;
  }
  while((long double)(clock()-start)/CLOCKS_PER_SEC < 1.5) {
    long double temp = 50;
    for(int i = 0;i<m;i++)mask[i]=rng()%2;
    int old = eval();
    while(temp>0.01) {
      int c = rng()%m;
      mask[c]^=1;
      int nw = eval();
      if(nw==0) {
        for(int i:mask)cout << i;
        cout << "\n";
        return 0;
      }
      long double rn = (long double)(rng()%1000)/1000;
      if(P(old, nw, temp)>rn) {
        old=nw;
      }
      else {
        mask[c]^=1;
      }
      temp*=0.95;
    }
//    cerr << fixed << setprecision(5) << (long double)temp << endl;
  }
  cout << "impossible\n";
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1500 ms 432 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1501 ms 428 KB Output is correct
11 Correct 1500 ms 432 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1501 ms 428 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 544 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1501 ms 596 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1501 ms 432 KB Output is correct
30 Correct 1500 ms 428 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1500 ms 436 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1501 ms 592 KB Output is correct
35 Correct 1500 ms 432 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 440 KB Output is correct
38 Correct 1501 ms 432 KB Output is correct
39 Correct 0 ms 600 KB Output is correct
40 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1500 ms 432 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1501 ms 428 KB Output is correct
11 Correct 1500 ms 432 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1501 ms 428 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 544 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1501 ms 596 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1501 ms 432 KB Output is correct
30 Correct 1500 ms 428 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1500 ms 436 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1501 ms 592 KB Output is correct
35 Correct 1500 ms 432 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 440 KB Output is correct
38 Correct 1501 ms 432 KB Output is correct
39 Correct 0 ms 600 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Incorrect 1501 ms 436 KB 'impossible' claimed, but there is a solution
44 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1500 ms 432 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1501 ms 428 KB Output is correct
11 Correct 1500 ms 432 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1501 ms 428 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 544 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1501 ms 596 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1501 ms 432 KB Output is correct
30 Correct 1500 ms 428 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1500 ms 436 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1501 ms 592 KB Output is correct
35 Correct 1500 ms 432 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 440 KB Output is correct
38 Correct 1501 ms 432 KB Output is correct
39 Correct 0 ms 600 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Incorrect 1501 ms 436 KB 'impossible' claimed, but there is a solution
44 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2300 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1524 ms 1828 KB Output is correct
4 Correct 9 ms 1880 KB Output is correct
5 Incorrect 1544 ms 2348 KB 'impossible' claimed, but there is a solution
6 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1500 ms 432 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1501 ms 428 KB Output is correct
11 Correct 1500 ms 432 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1501 ms 428 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 544 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1501 ms 596 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1501 ms 432 KB Output is correct
30 Correct 1500 ms 428 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1500 ms 436 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1501 ms 592 KB Output is correct
35 Correct 1500 ms 432 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 440 KB Output is correct
38 Correct 1501 ms 432 KB Output is correct
39 Correct 0 ms 600 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Incorrect 1501 ms 436 KB 'impossible' claimed, but there is a solution
44 Halted 0 ms 0 KB -