oj.uz

Submission #1107560

# Submission time Handle Problem Language Result Execution time Memory
1107560 2024-11-01T13:28:18 Z 8pete8 Stray Cat (JOI20_stray) C++17
15 / 100
 43 ms 16216 KB 
#include "Anthony.h"
#include <vector>
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
using namespace std;
namespace {

int FunctionExample(int i, int A) {
  return i % A;
}

}  // namespace

vector<int> Mark(int n,int m, int a, int b,vector<int> U,vector<int> V) {
  vector<int> X(m);
  vector<int>lvl(n+1,1e9),vis(n,0);
  vector<vector<pii>>adj(n);
  for(int i=0;i<m;i++){
    adj[U[i]].pb({V[i],i}),adj[V[i]].pb({U[i],i});
  }
  queue<int>q;
  lvl[0]=0;
  q.push(0);
  while(!q.empty()){
    int cur=q.front();
    q.pop();
    if(vis[cur])continue;
    vis[cur]=1;
    for(auto i:adj[cur])if(!vis[i.f]&&lvl[i.f]>lvl[cur]+1){
      lvl[i.f]=lvl[cur]+1;
      q.push(i.f);
    }
  }
  if(a>=3){
    for(int i=0;i<n;i++)for(auto j:adj[i]){
      if(lvl[j.f]<lvl[i])X[j.s]=(lvl[j.f]%3);
      else X[j.s]=lvl[i]%3;
    }
  }
  else{
    //0 0 1 1 0 1 0 0 1 1 0 1 0 0 1 1 0 1 0 0 1 1 0 1
    //1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0
    vector<int>pat={0,0,1,1,0,1};
    function<void(int,int)> dfs=[&](int cur,int p){
      for(auto i:adj[cur])if(i.f!=p){
        X[i.s]=pat[lvl[cur]%6];
        dfs(i.f,cur);
      }
    };
    dfs(0,-1);
  }
  return X;
}

#include "Catherine.h"
#include <vector>
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
using namespace std;
using namespace std;
namespace {

int a, b;
int variable_example = 0;
int found=0;
deque<int>cor={1,0,1,1,0,0};
vector<int>have;
}
void Init(int A, int B){
  ::a = A;
  ::b = B;
  found=0;
  have.clear();
}
int Move(vector<int> y){
  if(a>=3){
    int cnt=0;
    for(auto i:y)cnt+=!!i;
    if(cnt==0)assert(0);
    if(cnt==1){
      for(int i=0;i<y.size();i++)if(y[i])return i;
    }
    if(cnt==2){
      if(y[0]&&y[2])return 2;
      if(y[1]&&y[2])return 1;
      if(y[0]&&y[1])return 0;
    }
    assert(0);
  }
  else{
    if(have.size()<6&&!found){
      for(int i=0;i<y.size();i++)if(y[i]){
        have.pb(i);
        return i;
      }
      found=1;
      return -1;
    }
    else if(!found){
      int same=0;
      for(int i=0;i<6;i++){
        int yes=1;
        for(int j=0;j<6;j++)if(have[j]!=cor[j])yes=0;
        same|=yes;
        cor.push_back(cor.front());
        cor.pop_front();
      }
      found=1;
      if(!same)return -1;
    }
    for(int i=0;i<y.size();i++)if(y[i])return i;
  }
  return -1;
}

Compilation message

Anthony.cpp:34:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   34 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
Anthony.cpp:38:33: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   38 | int FunctionExample(int i, int A) {
      |                                 ^
Anthony.cpp:44:71: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   44 | vector<int> Mark(int n,int m, int a, int b,vector<int> U,vector<int> V) {
      |                                                                       ^
Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:74:50: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   74 |     function<void(int,int)> dfs=[&](int cur,int p){
      |                                                  ^
Anthony.cpp: At global scope:
Anthony.cpp:38:5: warning: 'int {anonymous}::FunctionExample(int, int)' defined but not used [-Wunused-function]
   38 | int FunctionExample(int i, int A) {
      |     ^~~~~~~~~~~~~~~

Catherine.cpp:34:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   34 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
Catherine.cpp:45:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   45 | void Init(int A, int B){
      |                       ^
Catherine.cpp:51:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   51 | int Move(vector<int> y){
      |                       ^
Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:57:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |       for(int i=0;i<y.size();i++)if(y[i])return i;
      |                   ~^~~~~~~~~
Catherine.cpp:68:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |       for(int i=0;i<y.size();i++)if(y[i]){
      |                   ~^~~~~~~~~
Catherine.cpp:87:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     for(int i=0;i<y.size();i++)if(y[i])return i;
      |                 ~^~~~~~~~~
Catherine.cpp: At global scope:
Catherine.cpp:40:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   40 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15460 KB Output is correct
2 Correct 2 ms 764 KB Output is correct
3 Correct 28 ms 14684 KB Output is correct
4 Correct 43 ms 16216 KB Output is correct
5 Correct 43 ms 16200 KB Output is correct
6 Correct 34 ms 15316 KB Output is correct
7 Correct 34 ms 15156 KB Output is correct
8 Correct 38 ms 15968 KB Output is correct
9 Correct 39 ms 15740 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15460 KB Output is correct
2 Correct 2 ms 764 KB Output is correct
3 Correct 28 ms 14684 KB Output is correct
4 Correct 43 ms 16216 KB Output is correct
5 Correct 43 ms 16200 KB Output is correct
6 Correct 34 ms 15316 KB Output is correct
7 Correct 34 ms 15156 KB Output is correct
8 Correct 38 ms 15968 KB Output is correct
9 Correct 39 ms 15740 KB Output is correct
10 Correct 33 ms 13028 KB Output is correct
11 Correct 35 ms 13260 KB Output is correct
12 Correct 28 ms 13268 KB Output is correct
13 Correct 31 ms 13260 KB Output is correct
14 Correct 32 ms 13512 KB Output is correct
15 Correct 32 ms 13836 KB Output is correct
16 Correct 32 ms 15748 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 12896 KB Output is correct
2 Correct 1 ms 764 KB Output is correct
3 Correct 34 ms 12336 KB Output is correct
4 Correct 39 ms 14344 KB Output is correct
5 Correct 37 ms 14172 KB Output is correct
6 Correct 32 ms 13080 KB Output is correct
7 Correct 30 ms 12860 KB Output is correct
8 Correct 39 ms 13592 KB Output is correct
9 Correct 33 ms 13664 KB Output is correct
10 Correct 36 ms 13376 KB Output is correct
11 Correct 32 ms 13408 KB Output is correct
12 Correct 34 ms 13360 KB Output is correct
13 Correct 40 ms 13380 KB Output is correct
14 Correct 39 ms 13588 KB Output is correct
15 Correct 34 ms 13588 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 12896 KB Output is correct
2 Correct 1 ms 764 KB Output is correct
3 Correct 34 ms 12336 KB Output is correct
4 Correct 39 ms 14344 KB Output is correct
5 Correct 37 ms 14172 KB Output is correct
6 Correct 32 ms 13080 KB Output is correct
7 Correct 30 ms 12860 KB Output is correct
8 Correct 39 ms 13592 KB Output is correct
9 Correct 33 ms 13664 KB Output is correct
10 Correct 36 ms 13376 KB Output is correct
11 Correct 32 ms 13408 KB Output is correct
12 Correct 34 ms 13360 KB Output is correct
13 Correct 40 ms 13380 KB Output is correct
14 Correct 39 ms 13588 KB Output is correct
15 Correct 34 ms 13588 KB Output is correct
16 Correct 27 ms 11308 KB Output is correct
17 Correct 27 ms 11212 KB Output is correct
18 Correct 27 ms 11212 KB Output is correct
19 Correct 27 ms 11212 KB Output is correct
20 Correct 32 ms 11936 KB Output is correct
21 Correct 31 ms 11720 KB Output is correct
22 Correct 33 ms 13540 KB Output is correct
23 Correct 30 ms 11476 KB Output is correct
24 Correct 27 ms 11484 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1024 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 10804 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 11104 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -