oj.uz

Submission #629812

# Submission time Handle Problem Language Result Execution time Memory
629812 2022-08-15T08:12:00 Z TimDee Catfish Farm (IOI22_fish) C++17
3 / 100
 1000 ms 27932 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;


ll p2(int n, int m, vector<int> x, vector<int> y, vector<int> w) {

  vector<int> a(n,0), b(n,0);
  for (int i=0; i<m; ++i) {
    if (x[i]==0) a[y[i]]=w[i];
    else b[y[i]]=w[i];
  }
  ll ans=0;
  for (int i=0; i<n; ++i) ans+=b[i];
  ll cnt=ans;
  for (int i=0; i<n; ++i) {
    cnt+=a[i]-b[i];
    ans=max(ans,cnt);
  }
  return ans;

}

ll p3(int n, int m, vector<int> x, vector<int> w) {

  vector<int> a(n,0);
  vector<pair<int,int>> b(n);
  for (int i=0; i<n; ++i) b[i]={0,i};
  for (int i=0; i<m; ++i) {
    b[x[i]]={w[i],x[i]};
    a[x[i]]=w[i];
  }
  sort(b.begin(), b.end());
  vector<int> vis(n,0);
  ll ans=0;
  for (int i=0; i<n; ++i) {
    auto it=b[i];
    int j=it.second, w=it.first; 
    
    for (auto x:a) cout<<x<<' '; cout<<'\n';
    //for (auto x:vis) cout<<x<<' '; cout<<'\n';
    cout<<j<<' '<<w<<'\n';
    if ((j?(vis[j-1]?0:a[j-1]):0) + ((j<n-1)?(vis[j+1]?0:a[j+1]):0) > a[j]) {
      ans+=(j?(vis[j-1]?0:a[j-1]):0) + ((j<n-1)?(vis[j+1]?0:a[j+1]):0) - a[j];
      //cout<<(j?(vis[j-1]?0:a[j-1]):0)<<' '<<((j<n-1)?(vis[j+1]?0:a[j+1]):0)<<' '<<ans<<'\n';
      a[j]=0;
      if (j) vis[j-1]=1;
      if (j<n-1) vis[j+1]=1;
    }
  }
  return ans;

}

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {

  int _p1=1, _p2=1, _p3=1;
  ll sum=0;
  for (int i=0; i<m; ++i) {
    _p1&=!(x[i]&1);
    _p2&=x[i]<=1;
    _p3&=y[i]==0;
    sum+=w[i];
  }

  if (_p1) return sum;
  if (_p2) return p2(n,m,x,y,w);
  if (_p3) return p3(n,m,x,w);

}

Compilation message

fish.cpp: In function 'll p3(int, int, std::vector<int>, std::vector<int>)':
fish.cpp:41:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   41 |     for (auto x:a) cout<<x<<' '; cout<<'\n';
      |     ^~~
fish.cpp:41:34: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   41 |     for (auto x:a) cout<<x<<' '; cout<<'\n';
      |                                  ^~~~
fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
   71 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2272 KB Output is correct
2 Correct 36 ms 4108 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 97 ms 9740 KB Output is correct
6 Correct 92 ms 10404 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 76 ms 6884 KB Output is correct
3 Correct 91 ms 11224 KB Output is correct
4 Correct 22 ms 3540 KB Output is correct
5 Correct 29 ms 4168 KB Output is correct
6 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1089 ms 27932 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Possible tampering with the output
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Possible tampering with the output
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Possible tampering with the output
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1089 ms 27932 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2272 KB Output is correct
2 Correct 36 ms 4108 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 97 ms 9740 KB Output is correct
6 Correct 92 ms 10404 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 76 ms 6884 KB Output is correct
9 Correct 91 ms 11224 KB Output is correct
10 Correct 22 ms 3540 KB Output is correct
11 Correct 29 ms 4168 KB Output is correct
12 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
13 Halted 0 ms 0 KB -