SCP-CN-1919-J
2024年10月22日
修订 13
评分
45
↑ 55
↓ 14
支持率
80%
总票数 69
Wilson 95% 下界
68.8%
在相同票数下更稳健的支持率估计
争议指数
0.647
评分趋势
按周聚合 加载图表中...
最近修订
1 / 5
最近投票
1 / 7
2025-08-21
2025-08-19
2025-08-18
2025-08-13
2025-08-09
2025-08-08
2025-08-08
2025-08-08
2025-07-30
2025-07-29
相关页面
暂无推荐
页面源码
[[module CSS]]
.email-example .collapsible-block-folded a.collapsible-block-link {
animation: blink 0.8s ease-in-out infinite alternate;
}
@keyframes blink {
0% { color: transparent; }
50%, 100% { color: #b01; }
}
.email {border: solid 2px #000000; width: 88%; padding: 1px 15px; margin: 10px; box-shadow: 0 1px 3px rgba(0,0,0,.5)}
.email-example a.collapsible-block-link {font-weight: bold;}
.tofrom {margin-left: 10px; margin-top: 5px; padding: 1px 15px; border-left: solid 3px maroon}
[[/module]]
[[module css]]
.page {
display: block;
overflow: hidden;
font-family: "Monotype Corsiva", "Bradley Hand ITC", sans-serif;
font-style: normal;
background-attachment: scroll;
background-clip: border-box;
background-color: transparent;
background-image: linear-gradient(to top ,rgb(202, 219, 228) 0%, rgb(231, 233, 220) 8%);
background-origin: padding-box;
background-position: 0px 8px;
background-repeat: repeat;
background-size: 100% 20px;
border: 1px solid #CCC;
border-radius: 10px;
padding: 10px 10px;
margin-bottom: 10px;
box-shadow: 0px 1px 3px rgba(0, 0, 0, 0.2)
}
.page p,
.page ul {
line-height: 20px;
margin: 0;
}
[[/module]]
[[module CSS]]
.fakeprot .mailform-box .buttons{display:none;}
.fakeprot + .collapsible-block .collapsible-block-link {padding: 0.1em 0.5em;text-decoration: none;background-color: #F4F4F4;border: 1px solid #AAA;color: #000;}
.fakeprot + .collapsible-block .collapsible-block-link:hover {background-color: #DDD;color: #000;}
.fakeprot + .collapsible-block .collapsible-block-link:active {background-color: #DDD;color: #000;}
.fakeprot + .collapsible-block .collapsible-block-unfolded-link{margin:0.5em 0;text-align: center;}
.fakeprot + .collapsible-block .collapsible-block-folded{margin:0.5em 0;text-align: center;}
.fakeprot .passw input[type=text] {text-security:disc;-webkit-text-security:disc;-mox-text-security:disc;}
.mailform-box td:first-child {width: 80px;}
[[/module]]
[[>]]
[[module rate]]
[[/>]]
[[div class="page"]]
今天，我将尝试一项之前从未有人达成过的挑战，至今为止，SCP-CN-1919-J已被发现5年，尚未有人完成其项目文档的编写。这真的可能吗？真的能被达成吗？
[[>]]
[[module ListUsers users="."]]
%%title%%
[[/module]]
[[/>]]
[[/div]]
----
[[=]]
+ 基金会在线编辑系统
[[/=]]
[[div class="fakeprot"]]
[[module MailForm to="aaaa (DUMMY)" button=""]]
# name
* title: ID
* default: 你的名字
* type: text
* rules:
* required: true
* maxLength:10
* minLength: 100
[[/module]]
[[div class="passw"]]
[[module MailForm to="aaaa (DUMMY)" button=""]]
# affiliation
* title: 密码
* default: ・・・・・・・・・
* rules:
* required: true
* maxLength:10
* minLength: 100
[[/module]]
[[/div]]
[[/div]]
[[collapsible show="开始编辑" hide="停止编辑"]]
[[html]]
<!DOCTYPE html>
<html lang="en" xmlns="">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>SCP-CN-1919-J</title>
<!-- SCP CSS样式 -->
<link rel="stylesheet" href="https://d3g0gp89917ko0.cloudfront.net/v--b466fa696223/common--theme/base/css/style.css">
<link rel="stylesheet" href="https://sigma9.scpwikicn.com/cn/cn/sigma9_ch.min.css">
<!-- SCP JavaScript -->
<script type="text/javascript" src="https://d3g0gp89917ko0.cloudfront.net/v--b466fa696223/common--javascript/init.combined.js"></script>
<script type="text/javascript" src="https://d3g0gp89917ko0.cloudfront.net/v--b466fa696223/common--javascript/WIKIDOT.combined.js"></script>
<style>
#typing {
overflow: hidden;
}
@keyframes cursorImg {
0%, 100% { opacity: 0; }
50% { opacity: 1; }
}
#typing::after {
content: "";
display: inline-block;
width: 2px;
height: 1em;
animation: cursorImg 1s infinite steps(1, start);
vertical-align: bottom;
background-color: black;
}
</style>
</head>
<body>
<div id="typing"></div>
</body>
<!-- Typer JavaScript-->
<script>
class TextContent {
constructor(text, typingDelay = 150, lineDelay = 1000, deleteIndex = -1, shouldLineBreak = true) {
this.text = text;
this.typingDelay = typingDelay;
this.lineDelay = lineDelay;
this.deleteIndex = deleteIndex;
this.shouldLineBreak = shouldLineBreak;
this.nextOptions = [];
this.isEnd = false;
this.parseTextContent();
}
parseTextContent() {
const regex = /<[^>]*>|./g;
this.tokens = this.text.match(regex);
}
addNextOption(nextTextContent, probability) {
this.nextOptions.push({ content: nextTextContent, probability });
}
setEnd(){
this.isEnd = !this.isEnd;
}
getNext() {
if (this.nextOptions.length === 0) {
return null;
}
const random = Math.random();
let cumulativeProbability = 0;
for (const option of this.nextOptions) {
cumulativeProbability += option.probability;
if (random < cumulativeProbability) {
return option.content;
}
}
return this.nextOptions[this.nextOptions.length - 1].content; // Fallback in case of rounding errors
}
getText() {
return this.text;
}
getTypingDelay() {
return this.typingDelay;
}
getLineDelay() {
return this.lineDelay;
}
getDeleteIndex() {
return this.deleteIndex;
}
shouldBreakLine() {
return this.shouldLineBreak;
}
}
class TypingEffect {
constructor(element, firstTextContent, timeoutCallback, useTimer) {
this.element = element;
this.currentTextContent = firstTextContent;
this.currentCharIndex = 0;
this.contentBuffer = '';
this.isDeleting = false;
this.timeoutCallback = timeoutCallback; // 用于重启全文的回调函数
this.isStopped = false; // 标记，用于判断是否停止当前打字过程
this.timerSet = !useTimer; // 计时器是否已经设置
}
startTyping() {
if (!this.timerSet) {
this.startTimer();
this.timerSet = true;
}
this.typeCharacter();
}
startTimer() {
this.resetTimer = setTimeout(() => {
console.log("3分钟内未触发终点，追加新的内容。");
this.stopTyping();
this.timeoutCallback();
}, 180000); // 180,000 毫秒 = 3 分钟
}
stopTyping() {
this.isStopped = true;
}
typeCharacter() {
if (this.isStopped) return;
if (this.currentTextContent) {
const tokens = this.currentTextContent.tokens;
if (this.currentCharIndex < tokens.length && !this.isDeleting) {
const token = tokens[this.currentCharIndex];
this.contentBuffer += token;
this.currentCharIndex++;
this.updateElementContent();
setTimeout(() => this.typeCharacter(), Math.random() * this.currentTextContent.getTypingDelay() + 25);
} else if (this.currentTextContent.getDeleteIndex() !== -1 && this.currentCharIndex > this.currentTextContent.getDeleteIndex()) {
this.isDeleting = true;
setTimeout(() => this.deleteCharacter(), Math.random() * this.currentTextContent.getTypingDelay() + 25);
} else {
this.currentCharIndex = 0;
this.isDeleting = false;
// 如果当前文本是结束文本，则清除计时器
if (this.currentTextContent.isEnd) {
console.log("提前抵达终点")
this.clearTimer();
}
setTimeout(() => {
if (this.currentTextContent.shouldBreakLine()) {
this.contentBuffer += '<br>';
}
this.currentTextContent = this.currentTextContent.getNext();
this.updateElementContent();
this.typeCharacter();
}, this.currentTextContent.getLineDelay());
}
}
}
deleteCharacter() {
if (this.isStopped) return; // 如果已停止，则不继续删除
const deleteIndex = this.currentTextContent.getDeleteIndex();
if (this.currentCharIndex > deleteIndex) {
const tokens = this.currentTextContent.tokens;
this.currentCharIndex--;
const token = tokens[this.currentCharIndex];
this.contentBuffer = this.contentBuffer.slice(0, -token.length);
this.updateElementContent();
setTimeout(() => this.deleteCharacter(), Math.random() * this.currentTextContent.getTypingDelay() + 50);
} else {
// 删除完成，进入下一段文本
this.currentCharIndex = 0;
this.isDeleting = false;
setTimeout(() => {
if (this.currentTextContent.shouldBreakLine()) {
this.contentBuffer += '<br>';
}
this.currentTextContent = this.currentTextContent.getNext();
this.updateElementContent();
this.typeCharacter();
}, this.currentTextContent.getLineDelay());
}
}
updateElementContent() {
this.element.innerHTML = this.contentBuffer;
}
appendTyping(newEffect) {
this.stopTyping();
newEffect.startTyping();
}
clearTimer() {
if (this.resetTimer) {
clearTimeout(this.resetTimer);
}
}
}
function helpLink(textContentList){
for (let i = 0; i < textContentList.length - 1; i ++){
textContentList[i].addNextOption(textContentList[i+1], 1)
}
}
</script> <!-- https://eddy114514.github.io/htmlRepo/typerSim/typerSim.js-->
<script>
const stdCtime = 50;
const stdLtime = 300;
function extractNextOptions(from) {
const contentList = [];
const probList = [];
for (let i = 0; i < from.nextOptions.length; i++) {
contentList.push(from.nextOptions[i].content);
probList.push(from.nextOptions[i].probability);
}
return { contentList, probList };
}
function helpInsert(from, insert){
const { contentList, probList } = extractNextOptions(from);
helpAssign(insert, contentList, probList);
from.nextOptions = [{ content: insert, probability: 1 }];
}
function insertWProb(from, insert, prob) {
const { contentList, probList } = extractNextOptions(from);
helpAssign(insert, contentList, probList);
const totalExistingProb = probList.reduce((sum, p) => sum + p, 0);
if (prob < 0 || prob > 1) {
throw new Error("Probability 'prob' must be between 0 and 1.");
}
if (totalExistingProb === 0) {
from.nextOptions = [{ content: insert, probability: prob }];
return;
}
const scale = (totalExistingProb - prob) / totalExistingProb;
if (scale < 0) {
throw new Error("The sum of existing probabilities is less than the new probability 'prob'.");
}
let newNext = [];
for (let i = 0; i < contentList.length; i++) {
const adjustedProb = probList[i] * scale;
newNext.push({
content: contentList[i],
probability: adjustedProb
});
}
from.nextOptions = newNext;
from.addNextOption(insert, prob);
}
function helpAssign(from, toList, probList) {
let existingTotalProb = from.nextOptions.reduce((sum, option) => sum + option.probability, 0);
let newTotalProb = probList.reduce((sum, p) => sum + p, 0);
let totalProb = existingTotalProb + newTotalProb;
if (totalProb <= 1) {
for (let i = 0; i < toList.length; i++) {
from.addNextOption(toList[i], probList[i]);
}
} else {
let scale = 1 / totalProb;
for (let option of from.nextOptions) {
option.probability *= scale;
}
for (let i = 0; i < toList.length; i++) {
let adjustedProb = probList[i] * scale;
from.addNextOption(toList[i], adjustedProb);
}
let adjustedTotalProb = from.nextOptions.reduce((sum, option) => sum + option.probability, 0);
if (adjustedTotalProb !== 1) {
let correction = 1 - adjustedTotalProb;
// 将修正值加到第一个选项的概率上
from.nextOptions[0].probability += correction;
}
}
}
function helpConclude(fromList, to){
for(let i = 0; i < fromList.length; i++){
fromList[i].addNextOption(to, 1);
}
}
function helpConcludeWprob(fromList, to, probList){
for(let i = 0; i < fromList.length; i++){
fromList[i].addNextOption(to, probList[i]);
}
}
function createCorrectionSequence(original, corrections) {
let current = original;
corrections.forEach(correction => {
current.addNextOption(correction, 1);
current = correction;
});
return current;
}
function linkContents(contents) {
for (let i = 0; i < contents.length - 1; i++) {
contents[i].addNextOption(contents[i + 1], 1);
}
}
function reload1C(){
return new TextContent("今天，我将尝试一项之前从未有人达成过的挑战，", stdCtime, stdLtime, -1, false);
}
function reload2C(){
return [new TextContent("至今为止，SCP-CN-1919-J已被发现5年，尚未有人完成其项目文档的编写。", stdCtime,stdLtime,-1,false),
new TextContent("至今为止，SCP-CN-1919-J已被发现九年，尚未有人完成其项目文档的编写。", stdCtime,stdLtime,-1,false),
new TextContent("至今为止，SCP-CN-1919已被发现5年，尚未有人完成其项目文档的编写。", stdCtime,stdLtime,-1,false)];
}
function reload3C(){
return new TextContent("这真的可能吗？真的能被达成吗？<br>", stdCtime,stdLtime,-1,true);
}
function reload11C(){
return new TextContent("今天，", stdCtime, stdLtime, -1, false);
}
function itemSetup(){
let reload1 = reload1C();
let [reload2, reload21,reload22] = reload2C();
let reload3 = reload3C();
let reload4 = reload11C();
reload4.addNextOption(reload3, 1);
helpAssign(reload1,[reload2,reload21,reload22, reload3], [0.3,0.3,0.3, 0.1]);
helpConcludeWprob([reload2,reload21,reload22],reload3,[0.5,0.5,0.5]);
const item= new TextContent("<b>项目编号：</b> SCP-CN-1919-J<br>", stdCtime,stdLtime, -1, true);
const item1 = new TextContent("<b>项目编号：</b> <br>", stdCtime,stdLtime, -1, true);
const item2= new TextContent("<b>项目编号：</b> SCP-CN-1919-J<br>", stdCtime,stdLtime, 7, true);
helpConclude([item1,item2], reload1);
return [item,item1,item2,reload1, reload2,reload3,reload4]
}
function objSetup(){
let reload1 = reload1C();
let [reload2, reload21,reload22] = reload2C();
let reload3 = reload3C();
let reload4 = reload11C();
reload4.addNextOption(reload3, 1);
helpAssign(reload1,[reload2,reload21,reload22, reload3], [0.3,0.3,0.3, 0.1]);
helpConcludeWprob([reload2,reload21,reload22],reload3,[0.5,0.5,0.5]);
const objClass = new TextContent("<b>项目等级：</b> Safe <br>", stdCtime,stdLtime, -1, true);
const objClass1 = new TextContent("<b>项目等级：</b><br>", stdCtime,stdLtime, -1, true);
const objClass2 = new TextContent("<b>项目等级：</b> Safe <br>", stdCtime,stdLtime, 7, true);
const objClass3 = new TextContent("<b>项目等级：</b> SCP-CN-1919-J <br>", stdCtime,stdLtime,-1,true);
helpConclude([objClass1,objClass2], reload1);
return [objClass,objClass1,objClass2, objClass3, reload1, reload2,reload3, reload4]
}
function helpLink2(textContentList, prob){
for (let i = 0; i < textContentList.length - 1; i ++){
textContentList[i].addNextOption(textContentList[i+1], prob)
}
}
function getPeriod(){
return new TextContent("。", stdCtime,500,0,false);
}
function getComma(){
return new TextContent("，", stdCtime,500,0,false);
}
function helpAct(toList, probList){
let res = new TextContent(" <br>", 0, 0, -1, true);
for(let i = 0; i<toList.length; i++){
res.addNextOption(toList[i], probList[i]);
}
return res;
}
</script> <!-- https://eddy114514.github.io/htmlRepo/typerSim/typerHelper.js-->
<script>
document.addEventListener("DOMContentLoaded", () => {
const stdCtime = 50;
const stdLtime = 300;
const typingElement = document.getElementById("typing");
const periodProb1 = new TextContent("。", stdCtime,500,0,false);
const commaProb1 = new TextContent("，", stdCtime, 500, 0, false);
const S = new TextContent(" ", 100,100,-1,false);
let [i1,i2,i3,ir1, ir2, ir3, ir4] = itemSetup();
let [c1,c2,c3,c4,cr1, cr2, cr3, cr4] = objSetup();
const scp = new TextContent(" ", 0, 0, -1, false);
const scProcedureFalse0 = new TextContent("<b>特殊收容措施：</b>SCP-CN-1919-J被收容于Site-CN-19的一个异常模因物品收容室中，基于项目的异常性质，任何对于SCP-CN-1919-J的实验需提前向项目主管或收容专家提交书面申请。", stdCtime, stdLtime, -1, false);
const scProcedureFalse01 = new TextContent("<b>特殊收容措施：</b>SCP-CN-1919-J被收容于Site-CN-19的一个异常模因物品收容室中，基于项目的异常性质，任何对于SCP-CN-1919-J的实验需提前向项目主管或收容专家提交书面申请。", stdCtime, stdLtime, 60, false);
const scProcedureFalse1 = new TextContent("任何相关实验在进行时，必须确保至少两名以上接受过异常模因对抗训练的安保人员在场", stdCtime, stdLtime, 19, false);
const scPF1Correction1 = new TextContent("接受过异常模因对抗训练的安保人员在场，", stdCtime, stdLtime, -1, false);
const scPC2 = new TextContent("且至少一名不在场的基金会人员知晓实验的存在，并实时地监控直至结束。", stdCtime, stdLtime, -1, false);
const scProcedureFalse2 = new TextContent("且至少一名不在场的基金会人员知晓实验的存在，并实时地监控并等待实验的结束",stdCtime,stdLtime, 28, false);
const scPF2Correction1 = new TextContent("且等待实验的结束。", stdCtime,5000,0,false);
const scPF2Correction2 = new TextContent("并等待实验的", stdCtime,3000,0,false);
const scPF2Correction3 = new TextContent("以及等待实验的结束。", stdCtime,stdLtime,-1,false);
const scPF2Correction31 = new TextContent("直至结束。", stdCtime,stdLtime, -1, false);
const scPF2Correction4 = new TextContent("MTF-天植-11“网络工程师”已投入使用，该机动特遣队将于全球范围内对SCP-CN-1919-J的相关信息传播进行限制。任何参与SCP-CN-1919-J相关实验的基金会人员于实验后有权采用最高B级的记忆强化措施，且无需经过站点主任审批。", stdCtime,stdLtime, -1, false);
const scPF2Correction5 = new TextContent("必须注意的是，根据至今为止的试验记录，任何人员都不被建议于实验或接触项目的过程中采用任何记忆强化措施。<br>", stdCtime, stdLtime, -1, true);
const scPF2Correction51 = new TextContent("必须注意的是，根据至今为止的试验记录，任何人员都不被建议于实验或接触项目的过程中采用任何记忆强化措施。<br>", stdCtime, stdLtime, 7, true);
const scProcedureCorrect = new TextContent("<b>特殊收容措施：</b>SCP-CN-1919-J被收容于Site-CN-19的一个异常模因物品收容室中，基于项目的异常性质，任何对于SCP-CN-1919-J的实验需提前向项目主管或收容专家提交书面申请。任何相关实验在进行时，必须确保至少两名接受过异常模因对抗训练的安保人员在场，且至少一名不在场的基金会人员知晓实验的存在，并实时地监控以及等待实验的结束。MTF-天植-11“网络工程师”已投入使用，该机动特遣队将于全球范围内对SCP-CN-1919-J的相关信息传播进行限制。任何参与SCP-CN-1919-J相关实验的基金会人员于实验后有权采用最高B级的记忆强化措施，且无需经过站点主任审批。必须注意的是，根据至今为止的试验记录，任何人员都不被建议于实验或接触项目的过程中采用任何记忆强化措施。<br>",150,1000, -1, true)
const description1 = new TextContent("<b>描述： </b>SCP-CN-1919-J是一类具备逆模因性质的异常模因实体，现阶段的研究认为项目不具备任何形式的智能。在大部分情况下，接触SCP-CN-1919-J的相关信息将导致人员产生可逆转的近似痴呆的症状，其中，大部分症状都集中表现为显著的记忆力退化",stdCtime,stdLtime, 113, false);
const description1Correction = new TextContent("表现为显著的记忆力退化。受SCP-CN-1919-J影响的人员，下称SCP-CN-1919-J-A，将无法准确认知自身的行为状态以及短期内的行为历史，或失去短期内的记忆。",stdCtime,stdLtime, -1, false);
const description11 = new TextContent("因此，至今为止撰写项目文档的尝试均以失败告终，与SCP-CN-1919-J相关的实验结果的准确性亦无法验证。<br>",stdCtime,stdLtime, -1, true);
const description2 = new TextContent("目前，SCP-CN-1919-J的项目文档仍未被编写完成，数名项目研究组人员被指令独立地编写文档。",stdCtime,stdLtime, -1, false);
const description21 = new TextContent("SCP-CN-1919-J的文档编写被认为是极其困难和耗时，且近似于无法完成的。",stdCtime,stdLtime,-1,false);
const description22 = new TextContent("同时，考虑到SCP-CN-1919-J的异常性质，任何人员在查阅项目文档时都可能被项目影响，进而被转化为SCP-CN-1919-J-A。尽管该转化进程被确认为可逆转的，被转化人员的工作效率以及热情都将被极大程度地削弱。",stdCtime,stdLtime,-1,true);
const description23 = new TextContent("因此，管理委员会仍在对是否停止SCP-CN-1919-J相关研究的议题进行讨论。",stdCtime,stdLtime,-1,true);
description23.setEnd();
helpAssign(S, [i1,i2,i3], [0.7,0.15,0.15]);
helpAssign(i1, [c1,c2,c3, c4], [0.25,0.5,0.2, 0.05]);
helpAssign(ir3, [i1,c1,c2,c3,c4], [0.75,0.1,0.05,0.05, 0.05]);
helpAssign(c1,[scp,scProcedureCorrect], [0.95,0.05]);
helpAssign(c4,[scp,scProcedureCorrect], [0.95,0.05]);
helpAssign(cr3,[c1,scp,scProcedureCorrect], [0.75,0.2,0.05]);
// SCP area
helpAssign(scp, [scProcedureFalse0, scProcedureFalse01], [0.8,0.2]);
helpAssign(scProcedureFalse0, [scProcedureFalse1, ir4, cr2], [0.7,0.15, 0.15]);
helpAssign(scProcedureFalse01, [ir2, ir4, cr2, cr4], [0.25, 0.25, 0.25, 0.25]);
helpAssign(scProcedureFalse1, [scPF1Correction1, ir1, c2, cr3, cr2], [0.7,0.1, 0.05, 0.1, 0.05])
helpAssign(scPF1Correction1, [scPC2,scProcedureFalse2, cr1, i3, c3], [0.2,0.5,0.1, 0.1, 0.1]);
insertWProb(scPF1Correction1, commaProb1, 0.05);
helpAssign(scPC2, [scPF2Correction4, ir1], [0.7, 0.3]);
insertWProb(scPC2, periodProb1, 0.05);
helpAssign(scProcedureFalse2, [scPF2Correction1, cr1], [0.7,0.3]);
helpAssign(scPF2Correction1, [scPF2Correction2, cr2], [0.6,0.4]);
helpAssign(scPF2Correction2, [scPF2Correction3,scPF2Correction31, cr2, cr3], [0.4,0.3,0.2,0.1]);
helpAssign(scPF2Correction3, [scPF2Correction4, cr2, helpAct([scProcedureFalse0,scProcedureFalse01], [0.66, 0.33])], [0.6, 0.2, 0.3]);
helpAssign(scPF2Correction31, [scPF2Correction4, cr3, helpAct([scProcedureFalse0,scPF2Correction2], [0.5, 0.5])], [0.6, 0.2,0.2]);
helpAssign(scPF2Correction4, [scPF2Correction5, scPF2Correction51], [0.6, 0.4]);
scPF2Correction51.addNextOption(cr2, 1);
// description area
helpAssign(scProcedureCorrect, [description1, cr4], [0.8, 0.2]);
helpAssign(scPF2Correction5, [description1, cr1], [0.6, 0.4]);
helpAssign(description1,[description1Correction,description11, c2, c3, cr3, helpAct([scProcedureFalse1,scProcedureCorrect],[0.5,0.5])], [0.3, 0.3, 0.1,0.1,0.1, 0.1]);
helpAssign(description1Correction, [description2, cr1], [0.6,0.4]);
helpAssign(description11, [description2, cr2], [0.6,0.4])
helpAssign(description2, [description21, ir1, ir2, description1Correction, description1, description11, cr3], [0.4, 0.1, 0.1, 0.1, 0.1, 0.1, 0.1]);
helpAssign(description21, [description22, ir1, ir2, ir3, description11, description2, cr3], [0.4, 0.1, 0.1, 0.1, 0.1, 0.1, 0.1]);
helpAssign(description22, [description23, ir4, ir2, ir3, description2, description21, cr3], [0.4, 0.1, 0.1, 0.1, 0.1, 0.1, 0.1]);
helpAssign(description23, [new TextContent(" ", 0, 0, -1, true), S, ir3, cr3, i2, c2, i3, c3, cr2], [0.2,0.1, 0.1, 0.1, 0.1, 0.1, 0.1, 0.1, 0.1]);
function endTyping(){
const end = new TextContent(" ", 0, 0, -1, true);
const item= new TextContent("<b>项目编号：</b> SCP-CN-1919-J<br>", stdCtime,stdLtime, -1, true);
const objClass = new TextContent("<b>项目等级：</b> Safe <br>", stdCtime,stdLtime, -1, true);
const SCP = new TextContent("<b>特殊收容措施：</b>SCP-CN-1919-J被收容于Site-CN-19的一个异常模因物品收容室中，基于项目的异常性质，任何对于SCP-CN-1919-J的实验需提前向项目主管或收容专家提交书面申请。任何相关实验在进行时，必须确保至少两名接受过异常模因对抗训练的安保人员在场，且至少一名不在场的基金会人员知晓实验的存在，并实时地监控以及等待实验的结束。MTF-天植-11“网络工程师”已投入使用，该机动特遣队将于全球范围内对SCP-CN-1919-J的相关信息传播进行限制。任何参与SCP-CN-1919-J相关实验的基金会人员于实验后有权采用最高B级的记忆强化措施，且无需经过站点主任审批。必须注意的是，根据至今为止的试验记录，任何人员都不被建议于实验或接触项目的过程中采用任何记忆强化措施。<br>",stdCtime,stdLtime, -1, true);
const description1 = new TextContent("<b>描述：</b>SCP-CN-1919-J是一类具备逆模因性质的异常模因实体，现阶段的研究认为项目不具备任何形式的智能。在大部分情况下，接触SCP-CN-1919-J的相关信息将导致人员产生可逆转的近似痴呆的症状，其中，大部分症状都表现为显著的记忆力退化。受SCP-CN-1919-J影响的人员，下称SCP-CN-1919-J-A，将无法准确认知自身的行为状态以及短期内的行为历史，或失去短期内的记忆。因此，至今为止撰写项目文档的尝试均以失败告终，与SCP-CN-1919-J相关的实验结果的准确性亦无法验证。<br>",stdCtime,stdLtime, -1, true);
const description2 = new TextContent("目前，SCP-CN-1919-J的项目文档仍未被编写完成，数名项目研究组人员被指令独立地编写文档。SCP-CN-1919-J的文档编写被认为是极其困难和耗时，且近似于无法完成的。同时，考虑到SCP-CN-1919-J的异常性质，任何人员在查阅项目文档时都可能被项目影响，进而被转化为SCP-CN-1919-J-A。尽管该转化进程被确认为可逆转的，被转化人员的工作效率以及热情都将被极大程度地削弱。因此，管理委员会仍在对是否停止SCP-CN-1919-J相关研究的议题进行讨论。<br>", stdCtime,stdLtime, -1, true);
const talk = new TextContent("很难想象！我居然完成了SCP-CN-1919-J的编写，我要立即向站点研究组报", 150, 2000, -1, false);
talk.addNextOption(ir1, 1);
helpLink([end, item,objClass,SCP,description1,description2,talk]);
const EndEffect = new TypingEffect(typingElement, end, null, false);
typingEffect.appendTyping(EndEffect);
}
const typingEffect = new TypingEffect(typingElement, S, endTyping, true);
typingEffect.startTyping();
});
</script> <!-- https://eddy114514.github.io/htmlRepo/typerSim/typerAction.js-->
</html>
[[/html]]
[[/collapsible]]