两个月前的水平:
#include
using namespace std;
int n,m;
const int maxn=2e6+5;
struct node{
int u,v;
};
node add[maxn*2];
vector v[maxn];
int dfn[maxn];
int low[maxn];
stack s;
int scc[maxn];
int res[maxn];
int ons[maxn];
int t;
int sum;
void dfs(int u){
t++;
dfn[u]=t;
low[u]=t;
ons[u]=true;
s.push(u);
for(int i=0;i int nex=v[u][i];
if(dfn[nex]==0){
dfs(nex);
low[u]=min(low[u],low[nex]);
}
else if(ons[nex]==true){
low[u]=min(low[u],dfn[nex]);
}
}
if(dfn[u]==low[u]){
sum++;
while(s.top()!=u){
int cur=s.top();
s.pop();
ons[cur]=false;
scc[cur]=sum;
res[sum]++;
}
s.pop();
ons[u]=false;
scc[u]=sum;
res[sum]++;
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
int a1,a2,b1,b2;
cin>>a1>>b1>>a2>>b2;
add[2*i].u=a1*2+1-b1;
add[2*i].v=a2*2+b2;
add[2*i+1].u=a2*2+1-b2;
add[2*i+1].v=a1*2+b1;
v[a1*2+1-b1].push_back(a2*2+b2);
v[a2*2+1-b2].push_back(a1*2+b1);
}
for(int i=2;i<=2*n+1;i++){
if(dfn[i]==0){
dfs(i);
}
}
for(int i=1;i<=n;i++){
if(scc[2*i]==scc[2*i+1]){
cout<<"IMPOSSIBLE";
return 0;
}
}
cout<<"POSSIBLE"< for(int i=1;i<=n;i++){
if(scc[2*i]cout<<0<<" ";
continue;
}
cout<<1<<" ";
}
}
现在的水平:
#include
using namespace std;
int main(){
cout<<"hello world.";
}
#include
using namespace std;
int n,m;
const int maxn=2e6+5;
struct node{
int u,v;
};
node add[maxn*2];
vector
int dfn[maxn];
int low[maxn];
stack
int scc[maxn];
int res[maxn];
int ons[maxn];
int t;
int sum;
void dfs(int u){
t++;
dfn[u]=t;
low[u]=t;
ons[u]=true;
s.push(u);
for(int i=0;i
if(dfn[nex]==0){
dfs(nex);
low[u]=min(low[u],low[nex]);
}
else if(ons[nex]==true){
low[u]=min(low[u],dfn[nex]);
}
}
if(dfn[u]==low[u]){
sum++;
while(s.top()!=u){
int cur=s.top();
s.pop();
ons[cur]=false;
scc[cur]=sum;
res[sum]++;
}
s.pop();
ons[u]=false;
scc[u]=sum;
res[sum]++;
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
int a1,a2,b1,b2;
cin>>a1>>b1>>a2>>b2;
add[2*i].u=a1*2+1-b1;
add[2*i].v=a2*2+b2;
add[2*i+1].u=a2*2+1-b2;
add[2*i+1].v=a1*2+b1;
v[a1*2+1-b1].push_back(a2*2+b2);
v[a2*2+1-b2].push_back(a1*2+b1);
}
for(int i=2;i<=2*n+1;i++){
if(dfn[i]==0){
dfs(i);
}
}
for(int i=1;i<=n;i++){
if(scc[2*i]==scc[2*i+1]){
cout<<"IMPOSSIBLE";
return 0;
}
}
cout<<"POSSIBLE"<
if(scc[2*i]
continue;
}
cout<<1<<" ";
}
}
现在的水平:
#include
using namespace std;
int main(){
cout<<"hello world.";
}
仪式感这个词这两年常常被提到,具体怎么翻译倒是有点意思.
大概是英语里没有准确对应的一个单词来表达这个意思。
上次看到译者孟老师这样分析,我觉得挺有帮助:
仪式感这个词既然不能字面翻译,不如我们先把它放到具体的语境中。
下班路上给自己买束花,早上起来用最爱的茶具泡壶好茶,闲下来给好朋友手写个表达感谢的便签,过年过节把家里装饰得特别有气氛。。。都可以算作是一种。
“仪式感”是为自己的生活添色增彩,不只是柴米油盐,还得活得用心、别致、精彩。
这样说来,“仪式感”更多是一种生活态度---a life attitude/philosophy that believes life can and should be lived to the fullest by being mindful and creative.
这样,我们大概就找到翻译“仪式感”的办法了:
•to make an ordinary life more interesting, exciting, or meaningful
•to spice up one's life
•to add some spice to an ordinary/a boring life
•to dress up for a special occasion
当然还有别的翻译方法,可以具体根据上下语境和表达中的侧重点选择。
大概是英语里没有准确对应的一个单词来表达这个意思。
上次看到译者孟老师这样分析,我觉得挺有帮助:
仪式感这个词既然不能字面翻译,不如我们先把它放到具体的语境中。
下班路上给自己买束花,早上起来用最爱的茶具泡壶好茶,闲下来给好朋友手写个表达感谢的便签,过年过节把家里装饰得特别有气氛。。。都可以算作是一种。
“仪式感”是为自己的生活添色增彩,不只是柴米油盐,还得活得用心、别致、精彩。
这样说来,“仪式感”更多是一种生活态度---a life attitude/philosophy that believes life can and should be lived to the fullest by being mindful and creative.
这样,我们大概就找到翻译“仪式感”的办法了:
•to make an ordinary life more interesting, exciting, or meaningful
•to spice up one's life
•to add some spice to an ordinary/a boring life
•to dress up for a special occasion
当然还有别的翻译方法,可以具体根据上下语境和表达中的侧重点选择。
处理家庭矛盾的节省时间的更优解决方案:
I. i have no intention to offer any suggestions to them cuz they NEVER long to correct their mistakes in logic.
II. & there's no need to add my opinions to the conversation cuz they would NEVER like to question their beliefs, especially the things they've known for a long time
——上述表达肯定不native,只是对新接收信息的学以致用罢了_
I. i have no intention to offer any suggestions to them cuz they NEVER long to correct their mistakes in logic.
II. & there's no need to add my opinions to the conversation cuz they would NEVER like to question their beliefs, especially the things they've known for a long time
——上述表达肯定不native,只是对新接收信息的学以致用罢了_
✋热门推荐